On the public citation graph

Gentzenization and decidability of some contraction-less relevant logics

https://doi.org/10.1007/bf00454743
0 signed · 41 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00211185openalex-snapshot
The gentzenization and decidability of RW
inferredcites →https://doi.org/10.1007/bf00249365openalex-snapshot
TW + and RW + are decidable
inferredcites →https://doi.org/10.1007/bf00258447openalex-snapshot
The consistency of the axiom of comprehension in the infinite-valued predicate logic of ?ukasiewicz
inferredcites →https://doi.org/10.1007/bf00935747openalex-snapshot
A metacompleteness theorem for contraction-free relevant logics
inferredcites →https://doi.org/10.1080/00048409012340183openalex-snapshot
A general logic
inferredcites →https://doi.org/10.1093/analys/39.3.124openalex-snapshot
Curry's Paradox
inferredcites →https://doi.org/10.1305/ndjfl/1093870447openalex-snapshot
The simple consistency of a set theory based on the logic ${\rm CSQ}$.
inferredcites →https://doi.org/10.1305/ndjfl/1093887722openalex-snapshot
Metacompleteness.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-19066-2_2openalex-snapshot
Implementation of Theorem Prover of Relevant Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-74772-9_13openalex-snapshot
Paraconsistent constructive logic with strong negation as a contraction-free relevant logic
inferred← citeshttps://doi.org/10.1007/978-94-007-6958-8_18openalex-snapshot
Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-0460-1_1openalex-snapshot
Relevance Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-0460-1_4openalex-snapshot
Paraconsistent Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-2109-7_13openalex-snapshot
Some Observations on Noncommutative Substructural Logics
inferred← citeshttps://doi.org/10.1007/bf00247002openalex-snapshot
Relevant implication and the case for a weaker logic
inferred← citeshttps://doi.org/10.1007/bf00260741openalex-snapshot
Hierarchical semantics for relevant logics
inferred← citeshttps://doi.org/10.1007/bf01050340openalex-snapshot
Rules in relevant logic - I: Semantic classification
inferred← citeshttps://doi.org/10.1007/bf01053260openalex-snapshot
Rules in relevant logic ? II: Formula representation
inferred← citeshttps://doi.org/10.1007/s10992-013-9290-6openalex-snapshot
Algebraic Kripke-Style Semantics for Relevance Logics
inferred← citeshttps://doi.org/10.1007/s11225-009-9172-7openalex-snapshot
Distributive Full Lambek Calculus Has the Finite Model Property
inferred← citeshttps://doi.org/10.1007/s11225-026-10239-8openalex-snapshot
A General Formalised Framework for Reasoning About Display Calculi
inferred← citeshttps://doi.org/10.1016/j.ijar.2012.11.004openalex-snapshot
Inconsistency-Tolerant Bunched Implications
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.04.029openalex-snapshot
Temporal BI: Proof system, semantics and translations
inferred← citeshttps://doi.org/10.1016/s0049-237x(07)80016-4openalex-snapshot
Semisimplicity
inferred← citeshttps://doi.org/10.1016/s0049-237x(13)70005-3openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s1874-5857(06)80030-0openalex-snapshot
Relevant and substructural logics
inferred← citeshttps://doi.org/10.1023/a:1005212701420openalex-snapshot
An O(n log n)-Space Decision Procedure for the Relevance Logic B+
inferred← citeshttps://doi.org/10.1023/a:1017998605966openalex-snapshot
Displaying and Deciding Substructural Logics 1: Logics with Contraposition
inferred← citeshttps://doi.org/10.1080/00048409612347591openalex-snapshot
A dilemma for Priest's dialethism?
inferred← citeshttps://doi.org/10.1080/11663081.2024.2336386openalex-snapshot
Nelson algebras, residuated lattices and rough sets: A survey
inferred← citeshttps://doi.org/10.1093/logcom/exq021openalex-snapshot
Cyclic Involutive Distributive Full Lambek Calculus is Decidable
inferred← citeshttps://doi.org/10.2178/jsl/1140641162openalex-snapshot
Normalized natural deduction systems for some relevant logics I: The logic DW
inferred← citeshttps://doi.org/10.2307/2275375openalex-snapshot
Relational proof system for relevant logics
inferred← citeshttps://doi.org/10.2307/2275666openalex-snapshot
Gentzenizations of relevant logics without distribution. I
inferred← citeshttps://doi.org/10.2307/2275668openalex-snapshot
Gentzenizations of relevant logics with distribution
inferred← citeshttps://doi.org/10.2307/2275819openalex-snapshot
Simple Gentzenizations for the normal formulae of contraction-less logics
inferred← citeshttps://doi.org/10.26181/22559581openalex-snapshot
Some concerns regarding ternary-relation semantics and truth-theoretic semantics in general
inferred← citeshttps://doi.org/10.26686/ajl.v1i0.1760openalex-snapshot
Semantic Decision Procedures for Some Relevant Logics
inferred← citeshttps://doi.org/10.29007/ngp3openalex-snapshot
Bunched Hypersequent Calculi for Distributive Substructural Logics
inferred← citeshttps://doi.org/10.4324/9780203016244openalex-snapshot
An Introduction to Substructural Logics
inferred← citeshttps://doi.org/10.48550/arxiv.1609.05847openalex-snapshot
A syntactic proof of decidability for the logic of bunched implication BI
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.