Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi
From MaRDI portal
Publication:2259003
DOI10.1007/s11225-013-9520-5zbMath1337.03020OpenAlexW2009544487MaRDI QIDQ2259003
Publication date: 27 February 2015
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-013-9520-5
finite axiomatizationintuitionistic propositional logicclassical propositional logicimplicational calculussuperintuitionistic calculustag system
Decidability of theories and sets of sentences (03B25) Classical propositional logic (03B05) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Craig's theorem in superintuitionistic logics and amalgamable varieties of pseudo-Boolean algebras
- Pretabular superintuitionistic logic
- Tag systems and lag systems
- The Post-Lineal theorems for arbitrary recursively enumerable degree of unsolvability
- A detailed argument for the Post-Linial theorems
- Results regarding the axiomatization of partial propositional calculi
- An undecidable problem in correspondence theory
- The undecidability of the disjunction property of propositional logics and other related problems
- A Relativization Procedure for Propositional Calculi, with an Application to a Generalized Form of Post's Theorem
- A note on finite axiomatization of partial propositional calculi
- Some Ways of Constructing a Propositional Calculus of Any Required Degree of Unsolvability
- A complex of problems proposed by Post
- Undecidability of the general problems of completeness, decidability and equivalence for propositional calculi
- Formal Reductions of the General Combinatorial Decision Problem
