On the number of variables in undecidable superintuitionistic propositional calculi
Grigoriy V. Bokov
Abstract
Grigoriy V. Bokov
Abstract
In this article, we construct an undecidable superintuitionistic propositional calculus using 3-variable axioms, i.e. an undecidable finitely axiomatizable extension of the intuitionistic propositional calculus with axioms containing only 3 variables. Since superintuitionistic propositional calculi cannot be axiomatized using less than 3 variables, this is the minimal possible number of variables.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this article, we construct an undecidable superintuitionistic propositional calculus using 3-variable axioms, i.e. an undecidable finitely axiomatizable extension of the intuitionistic propositional calculus with axioms containing only 3 variables. Since superintuitionistic propositional calculi cannot be axiomatized using less than 3 variables, this is the minimal possible number of variables.
Key concepts: Undecidable problem, Propositional variable, Propositional formula, Axiom, Propositional calculus, Mathematics, Extension (predicate logic), Calculus (dental)