HOW MUCH PROPOSITIONAL LOGIC SUFFICES FOR ROSSER’S ESSENTIAL UNDECIDABILITY THEOREM?

DOI10.1017/S175502032000012XzbMath1500.03004arXiv2006.12275OpenAlexW3007711641MaRDI QIDQ5078818

Guillermo Badia, Petr Hájek, Andrew Tedder, Petr Cintula

Publication date: 25 May 2022

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

Full work available at URL: https://arxiv.org/abs/2006.12275

zbMATH Keywords

undecidabilitysubstructural logicRobinson arithmetic

Mathematics Subject Classification ID

Fuzzy logic; logic of vagueness (03B52) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Cites Work

• Residuated lattices. An algebraic glimpse at substructural logics
• Undecidable theories
• Theory of Formal Systems. (AM-47)
• Proving termination with multiset orderings
• Variants of Robinson's essentially undecidable theoryR
• Exact Separation of Recursively Enumerable Sets Within Theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: HOW MUCH PROPOSITIONAL LOGIC SUFFICES FOR ROSSER’S ESSENTIAL UNDECIDABILITY THEOREM?