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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
De~Jongh, D.H.J., Veltman, F.: Intensional Logic. Lecture notes. Philosophy Department, University of Amsterdam, Amsterdam, 1988
Ladner, R.: The computational complexity of provability in systems of modal logic. SIAM Journal of Computing 6(3), 467–480 (1977)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, 1994
Spaan, E.: Complexity of modal logics. Dissertation, Faculty of mathematics and informatics, University of Amsterdam, Amsterdam, 1993
Statman, R.: Intuitionistic propositional logic is polynomial-space complete. Theoretical Comput. Sci. 9, 67–72 (1979)
Takeuti, G.: Proof Theory. North-Holland, Amsterdam, 1975
Van Dalen, D.: Intuitionistic logic. In: D. Gabbay, F. Guenthner eds, Handbook of Philosophical Logic, number~164–167 in Synthese Library, Chapter III.4, pp. 225–340. Kluwer, Dordrecht, 1986
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper was supported by grant 401/01/0218 of the Grant Agency of the Czech Republic. %
Mathematics Subject Classification (2000):
Rights and permissions
About this article
Cite this article
Švejdar, V. On the polynomial-space completeness of intuitionistic propositional logic. Arch. Math. Logic 42, 711–716 (2003). https://doi.org/10.1007/s00153-003-0179-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-003-0179-x