On the number of variables in undecidable superintuitionistic\n propositional calculi
Grigoriy V. Bokov
Abstract
Open-access reader
Grigoriy V. Bokov
Abstract
Open-access reader
In this paper, we construct an undecidable 3-variable superintuitionistic\npropositional calculus, i.e., a finitely axiomatizable extension of the\nintuitionistic propositional calculus with axioms containing only 3 variables.\nSince there are no 2-variable superintuitionistic propositional calculi, this\nis the minimal possible number of variables.\n
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 paper, we construct an undecidable 3-variable superintuitionistic\npropositional calculus, i.e., a finitely axiomatizable extension of the\nintuitionistic propositional calculus with axioms containing only 3 variables.\nSince there are no 2-variable superintuitionistic propositional calculi, this\nis the minimal possible number of variables.\n
Key concepts: Undecidable problem, Propositional variable, Propositional formula, Propositional calculus, Mathematics, Axiom, Well-formed formula, Variable (mathematics)