On the public citation graph
The undecidability of entailment and relevant implication
0 signed · 159 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19650110403openalex-snapshot
A Decision Procedure For the System EĪ of Entailment with Negation
inferredcites →https://doi.org/10.1002/malq.19730192601openalex-snapshot
An undecidable relevant logic
inferredcites →https://doi.org/10.1007/bf00258437openalex-snapshot
Career induction stops here (and here = 2)
inferredcites →https://doi.org/10.1016/0021-8693(73)90001-xopenalex-snapshot
Recursively unsolvable word problems of modular lattices and diagram-chasing
inferredcites →https://doi.org/10.1016/s0049-237x(08)71541-6openalex-snapshot
The Semantics of Entailment
inferredcites →https://doi.org/10.1090/s0002-9947-1974-0364040-2openalex-snapshot
The Undecidability of the Word Problems for Projective Geometries and Modular Lattices
inferredcites →https://doi.org/10.1090/s0002-9947-1980-0576864-xopenalex-snapshot
Free Modular Lattices
inferredcites →https://doi.org/10.25911/5d78d582d92e7openalex-snapshot
Gentzen systems and decision procedures for relevant logics
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.200610018openalex-snapshot
A finite model property for RMImin
inferred← citeshttps://doi.org/10.1002/malq.201400086openalex-snapshot
A decidable paraconsistent relevant logic: Gentzen system and Routley‐Meyer semantics
inferred← citeshttps://doi.org/10.1007/10703163_16openalex-snapshot
Kripke, Belnap, Urquhart and Relevant Decidability & Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4757-3627-4_12openalex-snapshot
The Undecidability of the Word Problem for Distributive Residuated Lattices
inferred← citeshttps://doi.org/10.1007/978-1-4899-0548-2_5openalex-snapshot
Gentzen-type or Beth-type Systems, Constructive Completeness Proofs and Practical Decision Procedures (with Special Attention to Relevance Logic)
inferred← citeshttps://doi.org/10.1007/978-3-030-25365-3_24openalex-snapshot
Expanding the Logic of Paradox with a Difference-Making Relevant Implication
inferred← citeshttps://doi.org/10.1007/978-3-030-25365-3_27openalex-snapshot
Some Comments and Replies
inferred← citeshttps://doi.org/10.1007/978-3-030-71258-7_7openalex-snapshot
R-Mingle is Nice, and so is Arnon Avron
inferred← citeshttps://doi.org/10.1007/978-3-030-71430-7_11openalex-snapshot
Modal Logics of Some Hereditarily Irresolvable Spaces
inferred← citeshttps://doi.org/10.1007/978-3-030-71430-7_12openalex-snapshot
St. Alasdair on Lattices Everywhere
inferred← citeshttps://doi.org/10.1007/978-3-030-71430-7_19openalex-snapshot
Satisfiability, Lattices, Temporal Logic and Constraint Logic Programming on Intervals
inferred← citeshttps://doi.org/10.1007/978-3-030-71430-7_2openalex-snapshot
Relevance-Sensitive Truth-Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-71430-7_22openalex-snapshot
Comments on the Contributions
inferred← citeshttps://doi.org/10.1007/978-3-030-71430-7_3openalex-snapshot
Tarskian Classical Relevant Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-71430-7_6openalex-snapshot
Geometric Models for Relevant Logics
inferred← citeshttps://doi.org/10.1007/978-3-030-71430-7_7openalex-snapshot
Revisiting Semilattice Semantics
inferred← citeshttps://doi.org/10.1007/978-3-030-76920-8_5openalex-snapshot
An Algebraic Glimpse at Bunched Implications and Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-39784-4_21openalex-snapshot
Relevant Reasoning and Implicit Beliefs
inferred← citeshttps://doi.org/10.1007/978-3-032-11027-5_18openalex-snapshot
An Informational Approach to Logic: Towards More Realistic Models of Logical Agents
inferred← citeshttps://doi.org/10.1007/978-3-319-08918-8_27openalex-snapshot
Implicational Relevance Logic is 2-ExpTime-Complete
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-29300-4_2openalex-snapshot
$$\mathbf {RM}$$ RM and its Nice Properties
inferred← citeshttps://doi.org/10.1007/978-3-319-69917-2_3openalex-snapshot
Larisa Maksimova’s Early Contributions to Relevance Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_28openalex-snapshot
Constructive Decision via Redundancy-Free Proof-Search
inferred← citeshttps://doi.org/10.1007/978-3-540-30597-2_9openalex-snapshot
Relevant Logic and Paraconsistency
inferred← citeshttps://doi.org/10.1007/978-3-662-48561-3_15openalex-snapshot
A Decidable Temporal Relevant Logic for Time-Dependent Relevant Human Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-662-59533-6_36openalex-snapshot
Substructural Propositional Dynamic Logics
inferred← citeshttps://doi.org/10.1007/978-94-007-0485-5_2openalex-snapshot
Interpolation and Definability
inferred← citeshttps://doi.org/10.1007/978-94-007-4438-7_13openalex-snapshot
Distribution in the Logic of Meaning Containment and in Quantum Mechanics
inferred← citeshttps://doi.org/10.1007/978-94-009-0553-5_4openalex-snapshot
The Frame Problem and Relevant Predication
inferred← citeshttps://doi.org/10.1007/978-94-009-0681-5_5openalex-snapshot
The Complexity of Decision Procedures in Relevance Logic
inferred← citeshttps://doi.org/10.1007/978-94-010-0526-5_9openalex-snapshot
Improved Decision Procedures for Pure Relevant Logic
inferred← citeshttps://doi.org/10.1007/978-94-015-8678-8_16openalex-snapshot
The Sequent Variant of System R
inferred← citeshttps://doi.org/10.1007/978-94-015-8678-8_17openalex-snapshot
Non-standard Sequent Calculi for Modal and Relevant Logics
inferred← citeshttps://doi.org/10.1007/978-94-017-1754-0_7openalex-snapshot
Tableau Methods for Substructural Logics
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/978-94-017-3598-8_8openalex-snapshot
Substructural Logics and Residuated Lattices — an Introduction
inferred← citeshttps://doi.org/10.1007/bf00211185openalex-snapshot
The gentzenization and decidability of RW
inferred← citeshttps://doi.org/10.1007/bf00244354openalex-snapshot
A decidable first-order logic for knowledge representation
inferred← citeshttps://doi.org/10.1007/bf00247002openalex-snapshot
Relevant implication and the case for a weaker logic
inferred← citeshttps://doi.org/10.1007/bf00260931openalex-snapshot
Modal translations in substructural logics
inferred← citeshttps://doi.org/10.1007/bf00379764openalex-snapshot
A note on the decidability of a strong relevant logic
inferred← citeshttps://doi.org/10.1007/bf01053260openalex-snapshot
Rules in relevant logic ? II: Formula representation
inferred← citeshttps://doi.org/10.1007/bf01190708openalex-snapshot
Decision problems for distributive lattice-ordered semigroups
inferred← citeshttps://doi.org/10.1007/bf01349560openalex-snapshot
Failure of interpolation in relevant logics
inferred← citeshttps://doi.org/10.1007/bf01880331openalex-snapshot
Implementing the ‘Fool's model’ of combinatory logic
inferred← citeshttps://doi.org/10.1007/bfb0055151openalex-snapshot
Mechanizing relevant logics with HOL
inferred← citeshttps://doi.org/10.1007/bfb0098459openalex-snapshot
The word and isomorphism problems in universal algebra
inferred← citeshttps://doi.org/10.1007/s00012-019-0609-1openalex-snapshot
Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids
inferred← citeshttps://doi.org/10.1007/s00500-018-3272-0openalex-snapshot
Paraconsistency and the need for infinite semantics
inferred← citeshttps://doi.org/10.1007/s10670-026-01120-0openalex-snapshot
Constructivism and Relevance
inferred← citeshttps://doi.org/10.1007/s10817-020-09555-yopenalex-snapshot
Constructive Decision via Redundancy-Free Proof-Search
inferred← citeshttps://doi.org/10.1007/s10992-015-9346-xopenalex-snapshot
Current Trends in Substructural Logics
inferred← citeshttps://doi.org/10.1007/s11225-017-9734-zopenalex-snapshot
A Second Pretabular Classical Relevance Logic
inferred← citeshttps://doi.org/10.1007/s11225-020-09903-4openalex-snapshot
A Conservative Negation Extension of Positive Semilattice Logic Without the Finite Model Property
inferred← citeshttps://doi.org/10.1007/s11225-020-09913-2openalex-snapshot
Lambek Calculus with Conjugates
inferred← citeshttps://doi.org/10.1007/s11225-025-10192-yopenalex-snapshot
A Proof-Theoretic Completeness Proof for Propositional Classical Core Logic
inferred← citeshttps://doi.org/10.1007/s11229-006-9049-5openalex-snapshot
The Undecidability of Propositional Adaptive Logic
inferred← citeshttps://doi.org/10.1007/s11787-014-0099-zopenalex-snapshot
Extracting BB′IW Inhabitants of Simple Types From Proofs in the Sequent Calculus $${LT_\to^{t}}$$ L T → t for Implicational Ticket Entailment
inferred← citeshttps://doi.org/10.1016/0168-0072(92)90075-bopenalex-snapshot
Decision problems for propositional linear logic
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90037-0openalex-snapshot
The semantics and proof theory of linear logic
inferred← citeshttps://doi.org/10.1016/b978-044451541-4/50011-7openalex-snapshot
Justificatory Irrelevance of Formal Semantics
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.08.012openalex-snapshot
A Unified Display Proof Theory for Bunched Logic
inferred← citeshttps://doi.org/10.1016/j.fss.2014.07.001openalex-snapshot
Paraconsistent fuzzy logic preserving non-falsity
inferred← citeshttps://doi.org/10.1016/j.jpaa.2018.09.015openalex-snapshot
Varieties of De Morgan monoids: Minimality and irreducible algebras
inferred← citeshttps://doi.org/10.1016/s1570-2464(02)80004-0openalex-snapshot
Standard logics as theories of argument and inference: Deduction
inferred← citeshttps://doi.org/10.1016/s1570-2464(02)80005-2openalex-snapshot
Standard logics as theories of argument and inference: Induction
inferred← citeshttps://doi.org/10.1016/s1874-5857(06)80030-0openalex-snapshot
Relevant and substructural logics
inferred← citeshttps://doi.org/10.1017/cbo9780511614002.002openalex-snapshot
Prologue: Postmodern Logic
inferred← citeshttps://doi.org/10.1017/cbo9780511614002.003openalex-snapshot
Conflict in the Abstract Sciences
inferred← citeshttps://doi.org/10.1017/jsl.2015.18openalex-snapshot
FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE
inferred← citeshttps://doi.org/10.1017/jsl.2015.7openalex-snapshot
IMPLICATIONAL RELEVANCE LOGIC IS 2-EXPTIME-COMPLETE
inferred← citeshttps://doi.org/10.1017/s0012217300011458openalex-snapshot
Truth or Consequences: Essays in Honor of Nuel BelnapMichael Dunn and Anil Gupta, eds. Dordrecht, Holland: Kluwer Academic Publishers, 1990, 378 pp. US$115
inferred← citeshttps://doi.org/10.1017/s0956796804005404openalex-snapshot
Deciding validity in a spatial logic for trees
inferred← citeshttps://doi.org/10.1017/s0960129512000412openalex-snapshot
Ticket Entailment is decidable
inferred← citeshttps://doi.org/10.1017/s1755020309090145openalex-snapshot
RELEVANCE LOGICS AND RELATION ALGEBRAS
inferred← citeshttps://doi.org/10.1017/s1755020309990293openalex-snapshot
RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS
inferred← citeshttps://doi.org/10.1017/s1755020318000448openalex-snapshot
VARIETIES OF DE MORGAN MONOIDS: COVERS OF ATOMS
inferred← citeshttps://doi.org/10.1017/s1755020325100713openalex-snapshot
FAILURE OF BETH’S THEOREM IN RELEVANCE 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.1023/b:stud.0000037126.29193.09openalex-snapshot
Adding Involution to Residuated Structures
inferred← citeshttps://doi.org/10.1090/memo/0604openalex-snapshot
Decision problems for equational theories of relation algebras
inferred← citeshttps://doi.org/10.1093/jigpal/10.3.299openalex-snapshot
Ultimate Normal Forms for Parallelized Natural Deductions
inferred← citeshttps://doi.org/10.1093/jigpal/11.6.675openalex-snapshot
Theory-Contraction is NP-Complete
inferred← citeshttps://doi.org/10.1093/jigpal/jzab031openalex-snapshot
The relevance logic of Boolean groups
inferred← citeshttps://doi.org/10.1093/logcom/exq021openalex-snapshot
Cyclic Involutive Distributive Full Lambek Calculus is Decidable
inferred← citeshttps://doi.org/10.1093/logcom/exx041openalex-snapshot
Decidable temporal and sequential relevant logics*
inferred← citeshttps://doi.org/10.1093/oxfordhb/9780195325928.003.0023openalex-snapshot
Relevance in Reasoning
inferred← citeshttps://doi.org/10.1109/smc.2013.321openalex-snapshot
Formalizing Inconsistency-Tolerant Relevant Human Reasoning: A Decidable Paraconsistent Relevant Logic with Constructible Falsity
inferred← citeshttps://doi.org/10.1145/2858784openalex-snapshot
Complexity Hierarchies beyond Elementary
inferred← citeshttps://doi.org/10.1145/604174.604183openalex-snapshot
Deciding validity in a spatial logic for trees
inferred← citeshttps://doi.org/10.1145/640136.604183openalex-snapshot
Deciding validity in a spatial logic for trees
inferred← citeshttps://doi.org/10.1215/00294527-1722719openalex-snapshot
New Consecution Calculi for R→t
inferred← citeshttps://doi.org/10.1305/ndjfl/1093634999openalex-snapshot
On the structure of De Morgan monoids with corollaries on relevant logic and theories.
inferred← citeshttps://doi.org/10.1305/ndjfl/1093635414openalex-snapshot
Relevance and paraconsistency---a new approach. II. The formal systems.
inferred← citeshttps://doi.org/10.1305/ndjfl/1093636940openalex-snapshot
Survey of generalizations of Urquhart semantics.
inferred← citeshttps://doi.org/10.17265/2159-5291/2015.02.002openalex-snapshot
Atomic Entailment and Atomic Inconsistency and Classical Entailment
inferred← citeshttps://doi.org/10.21146/2074-1472-2023-29-1-114-146openalex-snapshot
Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?
inferred← citeshttps://doi.org/10.2168/lmcs-6(3:3)2010openalex-snapshot
Classical BI: Its Semantics and Proof Theory
inferred← citeshttps://doi.org/10.2307/2586811openalex-snapshot
The complexity of decision procedures in relevance logic II
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.v13i1.3926openalex-snapshot
Relevance Logic: Problems Open and Closed
inferred← citeshttps://doi.org/10.26686/ajl.v15i2.4066openalex-snapshot
Two Manuscripts, One by Routley, One by Meyer: The Origins of the Routley-Meyer Semantics for Relevance Logics
inferred← citeshttps://doi.org/10.26686/ajl.v16i8.5732openalex-snapshot
Relevant Implication and Ordered Geometry
inferred← citeshttps://doi.org/10.26686/ajl.v18i5.6920openalex-snapshot
Arithmetic Formulated in a Logic of Meaning Containment
inferred← citeshttps://doi.org/10.26686/ajl.v18i5.6923openalex-snapshot
On Not Saying What We Shouldn't Have to Say
inferred← citeshttps://doi.org/10.26686/ajl.v19i1.7449openalex-snapshot
A Note on R-Mingle and the Danger of Safety
inferred← citeshttps://doi.org/10.26686/ajl.v1i0.1760openalex-snapshot
Semantic Decision Procedures for Some Relevant Logics
inferred← citeshttps://doi.org/10.2969/msjmemoirs/00201c060openalex-snapshot
Proof-Theoretic Methods in Nonclassical Logic --an Introduction
inferred← citeshttps://doi.org/10.3166/jancl.15.9-23openalex-snapshot
Decision procedure of some relevant logics: a constructive perspective
inferred← citeshttps://doi.org/10.4324/9780203016244openalex-snapshot
An Introduction to Substructural Logics
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.