On the undecidability of some sub-classical first-order logics

DOI10.1007/3-540-46691-6_20MaRDI QIDQ4501677zbMATH OpenFDO

Authors Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller, Helmut Veith

Publication date 11 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46691-6_20

zbMATH Keywords

cut-eliminationfragmentshypersequentsub-classical first-order logicsundecidabilityUrquhart's \({\mathbf C}\)

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Decidability of theories and sets of sentences (03B25) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Many-valued logic (03B50) Fuzzy logic; logic of vagueness (03B52) Cut-elimination and normal-form theorems (03F05)

Recommendations

• Undecidability of modal and intermediate first-order logics with two individual variables
• Undecidability of First-Order Intuitionistic and Modal Logics with Two variables
• Undecidability of multiplicative subexponential logic
• scientific article; zbMATH DE number 5289966
• Undecidability of modal logics of unary predicate

Cited in

(4)

• scientific article; zbMATH DE number 176530 (Why is no real title available?)
• Undecidability of multiplicative subexponential logic
• Synthetic Undecidability and Incompleteness of First-Order Axiom Systems in Coq
• Decidable and Undecidable Problems for First-Order Definability and Modal Definability

This page was built for publication: On the undecidability of some sub-classical first-order logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501677)