On the polynomial-space completeness of intuitionistic propositional logic

Archive for Mathematical Logic 42 (7):711-716 (2003)
  Copy   BIBTEX

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

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,756

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-11-23

Downloads
104 (#218,262)

6 months
7 (#633,574)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The decision problem of provability logic with only one atom.Vítězslav Švejdar - 2003 - Archive for Mathematical Logic 42 (8):763-768.
Proof Compression and NP Versus PSPACE II.Lew Gordeev & Edward Hermann Haeusler - 2020 - Bulletin of the Section of Logic 49 (3):213-230.

Add more citations

References found in this work

No references found.

Add more references