The undecidability of entailment and relevant implication

From MaRDI portal
Publication:3703869

DOI10.2307/2274261zbMath0581.03011OpenAlexW2009732936MaRDI QIDQ3703869

Alasdair Urquhart

Publication date: 1984

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274261



Related Items

Current trends in substructural logics, Decision problems for distributive lattice-ordered semigroups, A Decidable Temporal Relevant Logic for Time-Dependent Relevant Human Reasoning, The semantics and proof theory of linear logic, RELEVANCE LOGICS AND RELATION ALGEBRAS, What is relevance logic?, The concept of relevance and the logic diagram tradition, Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?, VARIETIES OF DE MORGAN MONOIDS: COVERS OF ATOMS, Relevant reasoning and implicit beliefs, Paraconsistent fuzzy logic preserving non-falsity, An algebraic glimpse at bunched implications and separation logic, A second pretabular classical relevance logic, Varieties of De Morgan monoids: minimality and irreducible algebras, Implementing the `Fool's model' of combinatory logic, RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS, The undecidability of propositional adaptive logic, $$\mathbf {RM}$$ RM and its Nice Properties, Expanding the Logic of Paradox with a Difference-Making Relevant Implication, Some Comments and Replies, Decision problems for propositional linear logic, Modal translations in substructural logics, Distribution in the Logic of Meaning Containment and in Quantum Mechanics, Failure of interpolation in relevant logics, New consecution calculi for \(R^{t}_{\to}\), Extracting \(\mathsf{BB'IW}\) inhabitants of simple types from proofs in the sequent calculus \(LT_\to^t\) for implicational ticket entailment, Ticket Entailment is decidable, Fragments of R-mingle, A conservative negation extension of positive semilattice logic without the finite model property, Constructive decision via redundancy-free proof-search, Lambek calculus with conjugates, Larisa Maksimova’s Early Contributions to Relevance Logic, A decidable paraconsistent relevant logic: Gentzen system and Routley-Meyer semantics, Displaying and deciding substructural logics. I: Logics with contraposition, Complexity Hierarchies beyond Elementary, Decision procedure of some relevant logics: a constructive perspective, Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids, Paraconsistency and the need for infinite semantics, Possible worlds and resources: The semantics of \(\mathbf{BI}\), R-Mingle is Nice, and so is Arnon Avron, A note on the decidability of a strong relevant logic, Rules in relevant logic. II: Formula representation, A Logical Autobiography, Relevance-Sensitive Truth-Trees, Tarskian Classical Relevant Logic, Geometric Models for Relevant Logics, Revisiting Semilattice Semantics, Modal Logics of Some Hereditarily Irresolvable Spaces, St. Alasdair on Lattices Everywhere, Satisfiability, Lattices, Temporal Logic and Constraint Logic Programming on Intervals, Comments on the Contributions



Cites Work