论文信息 - On the polynomial-space completeness of intuitionistic propositional logic

On the polynomial-space completeness of intuitionistic propositional logic

Abstract.We present an alternative, purely semantical and relatively simple, proof of the Statman's result that both intuitionistic propositional logic and its implicational fragment are PSPACE-complete.

Vítezslav Svejdar

[1] Richard E. Ladner,et al. The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[2] Richard Statman,et al. Intuitionistic Propositional Logic is Polynomial-Space Complete , 1979, Theor. Comput. Sci..