{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T11:03:17Z","timestamp":1777892597758,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,7,1]],"date-time":"1979-07-01T00:00:00Z","timestamp":299635200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12435,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1979,7]]},"DOI":"10.1016\/0304-3975(79)90006-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"67-72","source":"Crossref","is-referenced-by-count":138,"title":["Intuitionistic propositional logic is polynomial-space complete"],"prefix":"10.1016","volume":"9","author":[{"given":"Richard","family":"Statman","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90006-9_BIB1","series-title":"Proc. of the 7th Annual Symp. on Theory of Computing","article-title":"Feasibly constructive proofs and the propositional calculus","author":"Cook","year":"1975"},{"key":"10.1016\/0304-3975(79)90006-9_BIB2","series-title":"Proc. Sixth A.C.M. Symp. on Theory of Computing","article-title":"On the length of proofs in the propositional calculus","author":"Cook","year":"1974"},{"key":"10.1016\/0304-3975(79)90006-9_BIB3","volume":"Vol. 1","author":"Curry","year":"1968"},{"key":"10.1016\/0304-3975(79)90006-9_BIB4","series-title":"Intuitionistic Logic, Modal Theory and Forcing","author":"Fitting","year":"1969"},{"key":"10.1016\/0304-3975(79)90006-9_BIB5","article-title":"Equality between functionals","volume":"453","author":"Friedman","year":"1974"},{"key":"10.1016\/0304-3975(79)90006-9_BIB6","author":"Howard","year":"1969","journal-title":"The formulae-as-types notion of construction"},{"key":"10.1016\/0304-3975(79)90006-9_BIB7","series-title":"Introduction to Mathematics","author":"Kleene","year":"1952"},{"key":"10.1016\/0304-3975(79)90006-9_BIB8","doi-asserted-by":"crossref","first-page":"378","DOI":"10.2307\/2964012","article-title":"A remark on free choice sequences and topological completeness proofs","volume":"23","author":"Kreisel","year":"1958","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(79)90006-9_BIB9","series-title":"Formal Systems and Recursive Functions","article-title":"Semantical analysis of intuitionistic logic I","author":"Kripke","year":"1965"},{"issue":"3","key":"10.1016\/0304-3975(79)90006-9_BIB10","doi-asserted-by":"crossref","DOI":"10.1137\/0206033","article-title":"The computational complexity of provability in systems of model propositional logic","volume":"6","author":"Ladner","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(79)90006-9_BIB11","series-title":"Natural Deduction, Stockholm Studies in Philosophy 3","author":"Prawitz","year":"1965"},{"key":"10.1016\/0304-3975(79)90006-9_BIB12","series-title":"Mathematical Logic","author":"Shoenfield","year":"1967"},{"key":"10.1016\/0304-3975(79)90006-9_BIB13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(79)90007-0","article-title":"The typed \u03bb-calculus is not elementary recursive","volume":"9","author":"Statman","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(79)90006-9_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1976","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900069?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900069?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:54:40Z","timestamp":1555077280000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397579900069"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,7]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,7]]}},"alternative-id":["0304397579900069"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90006-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1979,7]]}}}