{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:36:55Z","timestamp":1743046615862,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230243"},{"type":"electronic","value":"9783540301240"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30124-0_27","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T17:27:59Z","timestamp":1267550879000},"page":"340-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Third-Order Bounded Arithmetic Theory for PSPACE"],"prefix":"10.1007","author":[{"given":"Alan","family":"Skelley","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,9,9]]},"reference":[{"key":"27_CR1","unstructured":"Buss, S.: Bounded Arithmetic, Bibliopolis, Naples (1986)"},{"key":"27_CR2","first-page":"116","volume-title":"Arithmetic, proof theory and computational complexity","author":"S. Buss","year":"1993","unstructured":"Buss, S., Kraj\u00b4\u0131\u010dek, J., Takeuti, G.: On provably total functions in bounded arithmetic theories ${R^i_3}$ , ${\\it U^i_2}$ and ${\\it V^i_2}$ . In: Clote, P., Kraj\u00b4\u0131\u010dek, J. (eds.) Arithmetic, proof theory and computational complexity, pp. 116\u2013161. Oxford University Press, Oxford (1993)"},{"issue":"1\u20132","key":"27_CR3","first-page":"67","volume":"75","author":"R. Samuel","year":"1995","unstructured":"Samuel, R.: Buss. Relating the bounded arithmetic and polynomial time hierarchies. Annals of Pure and Applied Logic\u00a075(1\u20132), 67\u201377 (1995)","journal-title":"Annals of Pure and Applied Logic"},{"key":"27_CR4","volume-title":"Handbook of Proof Theory","author":"S.R. Buss","year":"1998","unstructured":"Buss, S.R.: Handbook of Proof Theory. Elsevier Science B. V., Amsterdam (1998)"},{"key":"27_CR5","unstructured":"Buss, S.R.: Polynomial-size frege and resolution proofs of st-connectivity and hex tautologies. Typewritten manuscript (2003)"},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.2307\/2586729","volume":"63","author":"M. Chiari","year":"1998","unstructured":"Chiari, M., Kraj\u00b4\u0131\u010dek, J.: Witnessing functions in bounded arithmetic and search problems. The Journal of Symbolic Logic\u00a063(3), 1095\u20131115 (1998)","journal-title":"The Journal of Symbolic Logic"},{"issue":"1\u20133","key":"27_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0168-0072(92)90068-B","volume":"56","author":"P. Clote","year":"1992","unstructured":"Clote, P., Takeuti, G.: Bounded arithmetic for NC, ALogTIME, L and NL. Annals of Pure and Applied Logic\u00a056(1\u20133), 73\u2013117 (1992)","journal-title":"Annals of Pure and Applied Logic"},{"key":"27_CR8","first-page":"177","volume-title":"16th Annual IEEE Symposium on Logic in Computer Scienc (LICS 2001)","author":"S. Cook","year":"2001","unstructured":"Cook, S., Kolokolova, A.: A second-order system for polytime reasoning using Gr\u00e4del\u2019s theorem. In: 16th Annual IEEE Symposium on Logic in Computer Scienc (LICS 2001), pp. 177\u2013186. IEEE, Washington (2001)"},{"key":"27_CR9","unstructured":"Cook, S.A.: CSC 2429S: Proof Complexity and Bounded Arithmetic. Course notes, Winter (2002), http:\/\/www.cs.toronto.edu\/~sacook\/csc2429h"},{"key":"27_CR10","unstructured":"Cook, S., Soltys, M.: Boolean programs and quantified propositional proof systems. Bulletin of the Section of Logic\u00a028(3) (1999)"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Cook, S., Thapen, N.: The strength of replacement in weak arithmetic. In: LICS 2004 (2004, To appear)","DOI":"10.1109\/LICS.2004.1319620"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: Feasibly constructive proofs and the propositional calculus (preliminary version). In: Conference Record of Seventh Annual ACM Symposium on Theory of Computing, Albuquerque, New Mexico, May 5\u20137, pp. 83\u201397 (1975)","DOI":"10.1145\/800116.803756"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: Relating the provable collapse of P to NC1 and the power of logical theories. DIMACS Series in Discrete Math. and Theoretical Computer Science\u00a039 (1998)","DOI":"10.1090\/dimacs\/039\/05"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Kraj\u00b4\u0131\u010dek, J.: On Frege and Extended Frege proof systems. In: Clote, P., Remmel, J. (eds.) Feasible Mathematics II, Birkh\u00e4user, Boston, pp. 284\u2013319 (1995)","DOI":"10.1007\/978-1-4612-2566-9_10"},{"key":"27_CR15","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"},{"issue":"1\u20132","key":"27_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0168-0072(91)90043-L","volume":"52","author":"J. Kraj\u00b4\u0131\u010dek","year":"1991","unstructured":"Kraj\u00b4\u0131\u010dek, J., Pudl\u00b4ak, P., Takeuti, G.: Bounded arithmetic and the polynomial hierarchy. Annals of Pure and Applied Logic\u00a052(1\u20132), 143\u2013153 (1991)","journal-title":"Annals of Pure and Applied Logic"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Kraj\u00b4\u0131\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":"27_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4064\/fm-14-1-1-81","volume":"14","author":"S. Le\u00b4sniewski","year":"1929","unstructured":"Le\u00b4sniewski, S.: Grundz\u00fcge eines neunen Systems der Grundlagen der Mathematik. Fundamenta Mathematicae\u00a014, 1\u201381 (1929)","journal-title":"Fundamenta Mathematicae"},{"key":"27_CR19","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1093\/oso\/9780198536901.003.0012","volume-title":"Arithmetic, proof theory and computational complexity","author":"A.A. Razborov","year":"1993","unstructured":"Razborov, A.A.: An equivalence between second order bounded domain bounded arithmetic and furst order bounded arithmetic. In: Clote, P., Kraj\u00b4\u0131\u010dek, J. (eds.) Arithmetic, proof theory and computational complexity, pp. 247\u2013277. Oxford University Press, Oxford (1993)"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00288964","volume":"15","author":"S. Reisch","year":"1981","unstructured":"Reisch, S.: Hex ist PSPACE-vollst\u00e4ndig. Acta Informatica\u00a015, 167\u2013191 (1981)","journal-title":"Acta Informatica"},{"key":"27_CR21","unstructured":"Skelley, A.: Relating the PSPACE reasoning power of Boolean programs and quantified Boolean formulas. Master\u2019s thesis, University of Toronto, Available from ECCC in the \u2019theses\u2019 section (2000)"},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1007\/978-3-540-27836-8_96","volume-title":"Automata, Languages and Programming","author":"A. Skelley","year":"2004","unstructured":"Skelley, A.: Propositional PSPACE reasoning with boolean programs versus quantified boolean formulas. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1163\u20131175. Springer, Heidelberg (2004)"},{"key":"27_CR23","unstructured":"Soltys, M.: A model-theoretic proof of the completeness of LK proofs. Manuscript, available on author\u2019s web page (1999)"},{"key":"27_CR24","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1093\/oso\/9780198536901.003.0016","volume-title":"Arithmetic, proof theory and computational complexity","author":"G. Takeuti","year":"1993","unstructured":"Takeuti, G.: RSUV isomorphism. In: Clote, P., Kraj\u00b4\u0131\u010dek, J. (eds.) Arithmetic, proof theory and computational complexity, pp. 364\u2013386. Oxford University Press, Oxford (1993)"},{"issue":"3","key":"27_CR25","doi-asserted-by":"publisher","first-page":"942","DOI":"10.2307\/2275794","volume":"61","author":"D. Zambella","year":"1996","unstructured":"Zambella, D.: Notes on polynomially bounded arithmetic. The Journal of Symbolic Logic\u00a061(3), 942\u2013966 (1996)","journal-title":"The Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30124-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,24]],"date-time":"2024-03-24T15:02:52Z","timestamp":1711292572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30124-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230243","9783540301240"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30124-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"9 September 2004","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}