Intuitionistic propositional logic is polynomial-space complete
- 31 July 1979
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 9 (1) , 67-72
- https://doi.org/10.1016/0304-3975(79)90006-9
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The typed λ-calculus is not elementary recursiveTheoretical Computer Science, 1979
- The Computational Complexity of Provability in Systems of Modal Propositional LogicSIAM Journal on Computing, 1977
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- A remark on free choice sequences and the topological completeness proofsThe Journal of Symbolic Logic, 1958