{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:30:32Z","timestamp":1740123032792,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,28]],"date-time":"2017-12-28T00:00:00Z","timestamp":1514419200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stud Logica"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s11225-017-9773-5","type":"journal-article","created":{"date-parts":[[2017,12,28]],"date-time":"2017-12-28T00:48:59Z","timestamp":1514422139000},"page":"53-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Proof Compression and NP Versus PSPACE"],"prefix":"10.1007","volume":"107","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6238-7747","authenticated-orcid":false,"given":"L.","family":"Gordeev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. H.","family":"Haeusler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,28]]},"reference":[{"key":"9773_CR1","unstructured":"Gordeev, L., Basic dag compressions, Manuscript 2015."},{"issue":"1","key":"9773_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1093\/logcom\/3.1.63","volume":"3","author":"J Hudelmaier","year":"1993","unstructured":"Hudelmaier, J., An $$o\\left( n\\log n\\right)$$ o n log n -space decision procedure for intuitionistic propositional logic, Journal of Logic and Computation 3(1): 63\u201375, 1993.","journal-title":"Journal of Logic and Computation"},{"key":"9773_CR3","first-page":"119","volume":"4","author":"I Johansson","year":"1936","unstructured":"Johansson, I., Der minimalkalk\u00fcl, ein reduzierter intuitionistischer formalismus, Compositio Mathematica 4: 119\u2013136, 1936.","journal-title":"Compositio Mathematica"},{"issue":"5","key":"9773_CR4","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10958-009-9405-3","volume":"158","author":"L Gordeev","year":"2009","unstructured":"Gordeev,\u00a0L., E. H.\u00a0Haeusler, and V.\u00a0G. da\u00a0Costa, Proof compressions with circuit-structured substitutions, Journal of Mathematical Sciences 158(5): 645\u2013658, 2009.","journal-title":"Journal of Mathematical Sciences"},{"issue":"1","key":"9773_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1093\/jigpal\/jzq003","volume":"19","author":"L Gordeev","year":"2011","unstructured":"Gordeev,\u00a0L., E. H.\u00a0Haeusler, and L.\u00a0C. Pereira, Propositional proof compressions and dnf logic, Logic Journal of the IGPL 19(1): 62\u201386, 2011.","journal-title":"Logic Journal of the IGPL"},{"key":"9773_CR6","unstructured":"Prawitz, D., Natural deduction: a proof-theoretical study, Almqvist & Wiksell, 1965."},{"key":"9773_CR7","doi-asserted-by":"crossref","unstructured":"Quispe-Cruz, M., E.\u00a0H. Haeusler, and L. Gordeev, Proof-graphs for minimal implicational logic, in M. Ayala-Rinc\u00f3n, E. Bonelli, and I. Mackie, (eds.), Proceedings 9th International Workshop on Developments in Computational Models, Buenos Aires, Argentina, 26 August 2013, vol. 144 of Electronic Proceedings in Theoretical Computer Science, Open Publishing Association, 2014, pp. 16\u201329.","DOI":"10.4204\/EPTCS.144.2"},{"issue":"2","key":"9773_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"Walter J Savitch","year":"1970","unstructured":"Savitch, W.\u00a0J., Relationships between nondeterministic and deterministic tape complexities, J. Comput. Syst. Sci. 4(2): 177\u2013192, 1970.","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9773_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(79)90006-9","volume":"9","author":"Richard Statman","year":"1979","unstructured":"Statman, R., Intuitionistic propositional logic is polynomial-space complete, Theoretical Computer Science 9(1): 67\u201372, 1979.","journal-title":"Theoretical Computer Science"},{"issue":"7","key":"9773_CR10","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s00153-003-0179-x","volume":"42","author":"Vitezslav Svejdar","year":"2003","unstructured":"Svejdar, V., On the polynomial-space completeness of intuitionistic propositional logic Arch. Math. Log. 42(7): 711\u2013716, 2003.","journal-title":"Arch. Math. Log."}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11225-017-9773-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-017-9773-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-017-9773-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T15:49:10Z","timestamp":1570549750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11225-017-9773-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,28]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["9773"],"URL":"https:\/\/doi.org\/10.1007\/s11225-017-9773-5","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"type":"print","value":"0039-3215"},{"type":"electronic","value":"1572-8730"}],"subject":[],"published":{"date-parts":[[2017,12,28]]},"assertion":[{"value":"28 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}