On the polynomial-space completeness of intuitionistic propositional logic
✍ Scribed by Vítezslav Švejdar
- Publisher
- Springer
- Year
- 2003
- Tongue
- English
- Weight
- 140 KB
- Volume
- 42
- Category
- Article
- ISSN
- 0933-5846
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper we will study a formal system of intuitionistic modal predicate logic. The main result is its semantic completeness theorem with respect to algebraic structures. At the end of the paper we will also present a brief consideration of its syntactic relationships with some similar system
We prove that the intuitionistic sentential calculus is L-decidable (decidable in the sense of Lukasiewicz), i.e. the sets of theses of Int and of rejected formulas are disjoint and their union is equal to all formulas. A formula is rejected iff it is a sentential variable or is obtained from other