{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:09:28Z","timestamp":1742947768937,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022609"},{"type":"electronic","value":"9783642022616"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02261-6_1","type":"book-chapter","created":{"date-parts":[[2009,6,6]],"date-time":"2009-06-06T04:28:49Z","timestamp":1244262529000},"page":"1-12","source":"Crossref","is-referenced-by-count":2,"title":["A Characterisation of Definable NP Search Problems in Peano Arithmetic"],"prefix":"10.1007","author":[{"given":"Arnold","family":"Beckmann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Aehlig, K., Beckmann, A.: On the computational complexity of cut-reduction. Submitted to APAL (2008)","DOI":"10.1109\/LICS.2008.9"},{"key":"1_CR2","unstructured":"Beckmann, A., Buss, S.R.: Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic. Technical Report CSR15-2008, Department of Computer Science, Swansea University (December 2008)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Beckmann, A., Buss, S.R.: Characterising definable search problems in bounded arithmetic via proof notations. Technical report, Department of Computer Science, Swansea University (January 2009)","DOI":"10.1515\/9783110324907.65"},{"issue":"1-3","key":"1_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0168-0072(02)00066-0","volume":"120","author":"A. Beckmann","year":"2003","unstructured":"Beckmann, A., Buss, S.R., Pollett, C.: Ordinal notations and well-orderings in bounded arithmetic. Ann. Pure Appl. Logic\u00a0120(1-3), 197\u2013223 (2003)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1112\/plms\/s3-69.1.1","volume":"69","author":"S.R. Buss","year":"1994","unstructured":"Buss, S.R., Kraj\u00ed\u010dek, J.: An application of Boolean complexity to separation problems in bounded arithmetic. Proc. London Math. Soc. (3)\u00a069(1), 1\u201321 (1994)","journal-title":"Proc. London Math. Soc. (3)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF01621472","volume":"30","author":"W. Buchholz","year":"1991","unstructured":"Buchholz, W.: Notation systems for infinitary derivations. Archive for Mathematical Logic\u00a030, 277\u2013296 (1991)","journal-title":"Archive for Mathematical Logic"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/3-540-63385-5_29","volume-title":"Computational Logic and Proof Theory","author":"W. Buchholz","year":"1997","unstructured":"Buchholz, W.: Explaining Gentzen\u2019s consistency proof within infinitary proof theory. In: Gottlob, G., Leitsch, A., Mundici, D. (eds.) KGC 1997. LNCS, vol.\u00a01289, pp. 4\u201317. Springer, Heidelberg (1997)"},{"key":"1_CR8","series-title":"Studies in Proof Theory. Lecture Notes","volume-title":"Bounded arithmetic","author":"S.R. Buss","year":"1986","unstructured":"Buss, S.R.: Bounded arithmetic. Studies in Proof Theory. Lecture Notes, vol.\u00a03. Bibliopolis, Naples (1986)"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/BF01565428","volume":"112","author":"G. Gentzen","year":"1936","unstructured":"Gentzen, G.: Die Widerspruchsfreiheit der reinen Zahlentheorie. Math. Ann.\u00a0112, 493\u2013565 (1936)","journal-title":"Math. Ann."},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? J. Comput. System Sci.\u00a037(1), 79\u2013100 (1988); 26th IEEE Conference on Foundations of Computer Science (Portland, OR, 1985)","journal-title":"J. Comput. System Sci."},{"key":"1_CR11","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/BFb0064871","volume-title":"Logic Colloquium","author":"G. Kreisel","year":"1975","unstructured":"Kreisel, G., Mints, G.E., Simpson, S.G.: The use of abstract language in elementary metamathematics: Some pedagogic examples. In: Parikh, R. (ed.) Logic Colloquium. Lecture Notes in Mathematics, vol.\u00a0453, pp. 38\u2013131. Springer, Heidelberg (1975)"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1090\/S0002-9947-1993-1124169-X","volume":"338","author":"J. Kraj\u00ed\u010dek","year":"1993","unstructured":"Kraj\u00ed\u010dek, J.: Fragments of bounded arithmetic and bounded query classes. Trans. Amer. Math. Soc.\u00a0338(2), 587\u2013598 (1993)","journal-title":"Trans. Amer. Math. Soc."},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2178\/jsl\/1185803628","volume":"72","author":"J. Kraj\u00ed\u010dek","year":"2007","unstructured":"Kraj\u00ed\u010dek, J., Skelley, A., Thapen, N.: NP search problems in low fragments of bounded arithmetic. J. Symbolic Logic\u00a072(2), 649\u2013672 (2007)","journal-title":"J. Symbolic Logic"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/BF01091743","volume":"10","author":"G.E. Mints","year":"1978","unstructured":"Mints, G.E.: Finite investigations of transfinite derivations. Journal of Soviet Mathematics\u00a010, 548\u2013596 (1978); Translated from: Zap. Nauchn. Semin. LOMI 49 (1975); Cited after Grigori Mints. Selected papers in Proof Theory. Studies in Proof Theory. Bibliopolis (1992)","journal-title":"Journal of Soviet Mathematics"},{"key":"1_CR15","volume-title":"Proof theory. The first step into impredicativity. Universitext","author":"W. Pohlers","year":"2009","unstructured":"Pohlers, W.: Proof theory. The first step into impredicativity. Universitext. Springer, Berlin (2009)"},{"issue":"1-3","key":"1_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0168-0072(99)00008-1","volume":"100","author":"C. Pollett","year":"1999","unstructured":"Pollett, C.: Structure and definability in general bounded arithmetic theories. Ann. Pure Appl. Logic\u00a0100(1-3), 189\u2013245 (1999)","journal-title":"Ann. Pure Appl. Logic"},{"key":"1_CR17","series-title":"Lect. Notes Log.","first-page":"244","volume-title":"Logic Colloquium 2003","author":"P. Pudl\u00e1k","year":"2006","unstructured":"Pudl\u00e1k, P.: Consistency and games\u2014in search of new combinatorial principles. In: Logic Colloquium 2003. Lect. Notes Log., vol.\u00a024, pp. 244\u2013281. Assoc. Symbol. Logic, La Jolla (2006)"},{"key":"1_CR18","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BFb0075316","volume-title":"Methods in Mathematical Logic (Proceedings Caracas 1983)","author":"J. Paris","year":"1985","unstructured":"Paris, J., Wilkie, A.: Counting problems in bounded arithmetic. In: Dold, A., Eckmann, B. (eds.) Methods in Mathematical Logic (Proceedings Caracas 1983). Lecture Notes in Mathematics, vol.\u00a01130, pp. 317\u2013340. Springer, Heidelberg (1985)"},{"key":"#cr-split#-1_CR19.1","unstructured":"Skelley, A., Thapen, N.: The provable total search problems of bounded arithmetic (2007);"},{"key":"#cr-split#-1_CR19.2","unstructured":"Typeset manuscript"},{"key":"1_CR20","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/BFb0079691","volume-title":"The Syntax and Semantics of Infinitatry Languages","author":"W.W. Tait","year":"1968","unstructured":"Tait, W.W.: Normal derivability in classical logic. In: Barwise, J. (ed.) The Syntax and Semantics of Infinitatry Languages. Lecture Notes in Mathematics, vol.\u00a072, pp. 204\u2013236. Springer, Heidelberg (1968)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02261-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T15:10:51Z","timestamp":1685027451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02261-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022609","9783642022616"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02261-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}