{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:51:08Z","timestamp":1725565868349},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_96","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T22:53:21Z","timestamp":1284591201000},"page":"1163-1175","source":"Crossref","is-referenced-by-count":2,"title":["Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas"],"prefix":"10.1007","author":[{"given":"Alan","family":"Skelley","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"96_CR1","unstructured":"Buss, S.: Bounded Arithmetic. Bibliopolis, Naples (1986)"},{"volume-title":"Handbook of Proof Theory","year":"1998","key":"96_CR2","unstructured":"Buss, S.R. (ed.): Handbook of Proof Theory. Elsevier Science B. V., Amsterdam (1998)"},{"key":"96_CR3","unstructured":"Cook, S., Soltys, M.: Boolean programs and quantified propositional proof systems. Bulletin of the Section of Logic\u00a028(3) (1999)"},{"key":"96_CR4","unstructured":"Dowd, M.: Model theoretic aspects of P _= NP. Typewritten manuscript (1985)"},{"key":"96_CR5","volume-title":"Grundlagen der Mathematik I","author":"D. Hilbert","year":"1934","unstructured":"Hilbert, D., Bernays, P.: Grundlagen der Mathematik I. Springer, Berlin (1934)"},{"key":"96_CR6","volume-title":"Grundlagen der Mathematik II","author":"D. Hilbert","year":"1939","unstructured":"Hilbert, D., Bernays, P.: Grundlagen der Mathematik II. Springer, Berlin (1939)"},{"key":"96_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511529948","volume-title":"Bounded Arithmetic, Propositional Logic, and Complexity Theory","author":"J. Kraj\u00ed\u010dek","year":"1995","unstructured":"Kraj\u00ed\u010dek, J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press, Cambridge (1995)"},{"issue":"3","key":"96_CR8","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.2307\/2274765","volume":"54","author":"J. Kraj\u00ed\u010dek","year":"1989","unstructured":"Kraj\u00ed\u010dek, J., Pudl\u00e1k, P.: Propositional proof systems, the consistency of first order theories and the complexity of computations. The Journal of Symbolic Logic\u00a054(3), 1063\u20131079 (1989)","journal-title":"The Journal of Symbolic Logic"},{"key":"96_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/malq.19900360106","volume":"36","author":"J. Kraj\u00ed\u010dek","year":"1990","unstructured":"Kraj\u00ed\u010dek, J., Pudl\u00e1k, P.: Quantified propositional calculi and fragments of bounded arithmetic. Zeitschr. f. Mathematikal Logik u. Grundlagen d. Mathematik\u00a036, 29\u201346 (1990)","journal-title":"Zeitschr. f. Mathematikal Logik u. Grundlagen d. Mathematik"},{"key":"96_CR10","doi-asserted-by":"crossref","unstructured":"Kraj\u00ed\u010dek, J., Takeuti, G.: On bounded \u03a31 1 polynomial induction. In: Buss, S.R., Scott, P.J. (eds.) FEASMATH: Feasible Mathematics: A Mathematical Sciences Institute Workshop, Birkhauser, pp. 259\u2013280 (1990)","DOI":"10.1007\/978-1-4612-3466-1_15"},{"key":"#cr-split#-96_CR11.1","unstructured":"Skelley, A.: Relating the PSPACE reasoning power of Boolean programs and quantified Boolean formulas. Master???s thesis, University of Toronto (2000);"},{"key":"#cr-split#-96_CR11.2","unstructured":"Available from ECCC in the ???theses??? section"},{"key":"96_CR12","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time: Preliminary report. In: Conference Record of Fifth Annual ACM Symposium on Theory of Computing, Austin, Texas, April 30-May 2, pp. 1\u20139 (1973)","DOI":"10.1145\/800125.804029"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_96.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:24:10Z","timestamp":1605759850000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_96"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_96","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}