{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T05:14:57Z","timestamp":1740806097807,"version":"3.38.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2010,11,25]],"date-time":"2010-11-25T00:00:00Z","timestamp":1290643200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s00153-010-0220-9","type":"journal-article","created":{"date-parts":[[2010,11,24]],"date-time":"2010-11-24T16:28:01Z","timestamp":1290616081000},"page":"367-393","source":"Crossref","is-referenced-by-count":0,"title":["Conservative fragments of $${{S}^{1}_{2}}$$ and $${{R}^{1}_{2}}$$"],"prefix":"10.1007","volume":"50","author":[{"given":"Chris","family":"Pollett","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,25]]},"reference":[{"issue":"1","key":"220_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90057-S","volume":"53","author":"B. Allen","year":"1991","unstructured":"Allen B.: Arithmetizing uniform NC. Ann. Pure Appl. Logic 53(1), 1\u201350 (1991)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"220_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1142\/S0219061309000847","volume":"9","author":"A. Beckmann","year":"2009","unstructured":"Beckmann A., Buss S.R.: Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic. J. Math. Logic 9(1), 103\u2013138 (2009)","journal-title":"J. Math. Logic"},{"key":"220_CR3","doi-asserted-by":"crossref","unstructured":"Beckmann, A., Buss, S.R.: Characterising definable search problems in bounded arithmetic via proof notations. In: Schindler, R. (ed.) Ways of Proof Theory, Ontos Series on Mathematical Logic, pp. 65\u2013134 (2010)","DOI":"10.1515\/9783110324907.65"},{"key":"220_CR4","unstructured":"Boughattas, S., Ko\u0142odziejczyk, L.A.: The strength of sharply bounded induction requires MSP (2009) (to appear Annals of Pure and Applied Logic)"},{"key":"220_CR5","doi-asserted-by":"crossref","unstructured":"Boughattas, S., Ressayre, J.P.: Bootstrapping I (2009) (to appear Annals of Pure and Applied Logic)","DOI":"10.1016\/j.apal.2009.03.004"},{"key":"220_CR6","volume-title":"Bounded Arithmetic","author":"S.R. Buss","year":"1986","unstructured":"Buss S.R.: Bounded Arithmetic. Bibliopolis, Napoli (1986)"},{"key":"220_CR7","unstructured":"Cook, S., Nguyen, P.: Logical Foundations of Proof Complexity. Cambridge University Press (to appear in Perspectives in Logic)"},{"key":"220_CR8","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198536901.001.0001","volume-title":"Arithmetic, Proof Theory and Computational Complexity","author":"P. Clote","year":"1993","unstructured":"Clote P.: Polynomial size Frege proofs of certain combinatorial principles. In: Clote, P., Kraj\u00ed\u010dek, J. (eds) Arithmetic, Proof Theory and Computational Complexity, Oxford Science Publications, Oxford (1993)"},{"key":"220_CR9","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/978-1-4612-2566-9_6","volume-title":"Feasible Mathematics II","author":"P. Clote","year":"1995","unstructured":"Clote P., Takeuti G.: First-order bounded arithmetic and small boolean circuit complexity classes. In: Clote, P., Remmel, J. (eds) Feasible Mathematics II, pp. 154\u2013218. Birkhauser, Boston (1995)"},{"key":"220_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22156-3","volume-title":"Metamathematics of First-Order Arithmetics","author":"P. H\u00e1jek","year":"1993","unstructured":"H\u00e1jek P., Pudl\u00e1k P.: Metamathematics of First-Order Arithmetics. Springer, Berlin (1993)"},{"key":"220_CR11","doi-asserted-by":"crossref","unstructured":"Hanika, J.: Search problems and bounded arithmetic. Ph.D. Thesis. Charles University (2004)","DOI":"10.1002\/malq.200410005"},{"issue":"6","key":"220_CR12","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1002\/malq.200610019","volume":"52","author":"E. Je\u0159\u00e1bek","year":"2006","unstructured":"Je\u0159\u00e1bek E.: The strength of sharply bounded induction. Math. Logic Q. 52(6), 613\u2013624 (2006)","journal-title":"Math. Logic Q."},{"key":"220_CR13","doi-asserted-by":"crossref","unstructured":"Johannsen, J.: On sharply bounded length induction. In Proceedings of Computer Science Logic \u201995, pp. 362\u2013367. Paderborn 1995. Springer LNCS 1092. (1996)","DOI":"10.1007\/3-540-61377-3_48"},{"issue":"2","key":"220_CR14","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/malq.19980440207","volume":"44","author":"J. Johannsen","year":"1998","unstructured":"Johannsen J.: A model-theoretic property of sharply bounded formulae, with some applications. Math. Logic Q. 44(2), 205\u2013215 (1998)","journal-title":"Math. Logic Q."},{"key":"220_CR15","doi-asserted-by":"crossref","unstructured":"Johannsen, J., Pollett, C.: On proofs about threshold circuits and counting hierarchies. In Proceedings of Thirteenth IEEE Symposium on Logic in Computer Science, pp. 444\u2013452","DOI":"10.1109\/LICS.1998.705678"},{"key":"220_CR16","doi-asserted-by":"crossref","unstructured":"Johannsen, J., Pollett, C.: On the $${\\Delta^b_1}$$ -bit-comprehension rule. In: Buss, S., H\u00e1jek, P., Pudl\u00e1k, P. (eds.) Logic Colloquium \u201998. ASL Lecture Notes in Logic, pp. 262\u2013279 (2000)","DOI":"10.1017\/9781316756140.019"},{"key":"220_CR17","unstructured":"Ko\u0142odziejczyk, L.A.: Phuong Nguyen and Neil Thapen. The provably total NP search problems of weak second order arithmetic. Preliminary manuscript (2009)"},{"key":"220_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511529948","volume-title":"Bounded Arithmetic, Propositional Logic, and Complexity Theory, volume 60 of Encyclopedia of Mathematics and its Applications","author":"J. Kraj\u00ed\u010dek","year":"1995","unstructured":"Kraj\u00ed\u010dek J.: Bounded Arithmetic, Propositional Logic, and Complexity Theory, volume 60 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (1995)"},{"key":"220_CR19","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0168-0072(91)90043-L","volume":"52","author":"J. Kraj\u00ed\u010dek","year":"1991","unstructured":"Kraj\u00ed\u010dek J., Pudl\u00e1k P., Takeuti G.: Bounded arithmetic and polynomial hierarchy. Ann. Pure Appl. Logic 52, 143\u2013154 (1991)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"2","key":"220_CR20","doi-asserted-by":"crossref","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. Symb. Logic 72(2), 649\u2013672 (2007)","journal-title":"J. Symb. Logic"},{"key":"220_CR21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01531025","volume":"6","author":"S.-G. Mantzivis","year":"1991","unstructured":"Mantzivis S.-G.: Circuits in bounded arithmetic, part I. Ann. Math. Artif. Intell. 6, 127\u2013156 (1991)","journal-title":"Ann. Math. Artif. Intell."},{"key":"220_CR22","doi-asserted-by":"crossref","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 100, 189\u2013245 (1999)","journal-title":"Ann. Pure Appl. Logic"},{"key":"220_CR23","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0168-0072(00)00015-4","volume":"104","author":"C. Pollett","year":"2000","unstructured":"Pollett C.: Multifunction algebras and the provability of PH \u2193. Ann. Pure Appl. Logic 104, 279\u2013303 (2000)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"5","key":"220_CR24","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s00153-002-0162-y","volume":"42","author":"C. Pollett","year":"2003","unstructured":"Pollett C.: On the bounded version of Hilbert\u2019s tenth problem. Arch. Math. Logic 42(5), 469\u2013488 (2003)","journal-title":"Arch. Math. Logic"},{"issue":"4","key":"220_CR25","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.2178\/jsl\/1230396927","volume":"73","author":"P. Pudl\u00e1k","year":"2008","unstructured":"Pudl\u00e1k P.: Fragments of bounded arithmetic and the lengths of proofs. J. Symb. Logic 73(4), 1389\u20131406 (2008)","journal-title":"J. Symb. Logic"},{"key":"220_CR26","doi-asserted-by":"crossref","unstructured":"Shepherdson, J.C.: Non-standard models for fragments of number theory. In Proceedings of the 1963 International Symposium at Berkeley on the Theory of Models, pp. 342\u2013358. North-Holland, Amsterdam (1965)","DOI":"10.1016\/B978-0-7204-2233-7.50037-X"},{"key":"220_CR27","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 isomorphisms. In: Clote, P., Kraj\u00ed\u010dek, J. (eds) Arithmetic, Proof Theory and Computational Complexity, pp. 364\u2013386. Oxford Science Publications, Oxford (1993)"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-010-0220-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-010-0220-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-010-0220-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T05:33:55Z","timestamp":1740720835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-010-0220-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,25]]},"references-count":27,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["220"],"URL":"https:\/\/doi.org\/10.1007\/s00153-010-0220-9","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"type":"print","value":"0933-5846"},{"type":"electronic","value":"1432-0665"}],"subject":[],"published":{"date-parts":[[2010,11,25]]}}}