The undecidability of entailment and relevant implication

DOI10.2307/2274261zbMath0581.03011MaRDI 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

zbMATH Keywords

word problem; modular lattices; projective geometry; relevant logic; ticket entailment; relevant implication; coordinatization theorem; distributive lattice ordered commutative semigroups

Mathematics Subject Classification ID

20M05: Free semigroups, generators and relations, word problems

03B45: Modal logic (including the logic of norms)

03D35: Undecidability and degrees of sets of sentences

03B25: Decidability of theories and sets of sentences

06F05: Ordered semigroups and monoids

06C05: Modular lattices, Desarguesian lattices

03D40: Word problems, etc. in computability and recursion theory

Related Items

Failure of interpolation in relevant logics, A note on the decidability of a strong relevant logic, The semantics and proof theory of linear logic, Implementing the `Fool's model' of combinatory logic, Decision problems for propositional linear logic, Modal translations in substructural logics, Displaying and deciding substructural logics. I: Logics with contraposition, Rules in relevant logic. II: Formula representation, Fragments of R-mingle, Possible worlds and resources: The semantics of \(\mathbf{BI}\), Decision problems for distributive lattice-ordered semigroups, The undecidability of propositional adaptive logic

Cites Work

• Recursively unsolvable word problems of modular lattices and diagram- chasing
• The semantics of entailment. III
• An undecidable relevant logic
• On Entailment
• A Decision Procedure For the System E_Ī of Entailment with Negation