{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T07:28:55Z","timestamp":1648970935963},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T00:00:00Z","timestamp":1291334400000},"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-0221-8","type":"journal-article","created":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T16:17:58Z","timestamp":1291306678000},"page":"395-409","source":"Crossref","is-referenced-by-count":1,"title":["Nested PLS"],"prefix":"10.1007","volume":"50","author":[{"given":"Toshiyasu","family":"Arai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,12,3]]},"reference":[{"key":"221_CR1","unstructured":"Arai, T.: Intuitionistic fixed point theories over Heyting arithmetic. In: Feferman, S., Sieg, W. (eds.) Proofs, Categories and Computations. Essays in honor of Grigori Mints. College Publications, King\u2019s College London (to appear)"},{"key":"221_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, 103\u2013138 (2009)","journal-title":"J. Math. Logic"},{"key":"221_CR3","unstructured":"Beckmann, A., Buss, S.R.: Characterising definable search problems in bounded arithmetic via proof notations (submitted)"},{"key":"221_CR4","volume-title":"Bounded Arithmetic","author":"S.R. Buss","year":"1986","unstructured":"Buss S.R.: Bounded Arithmetic. Bibliopolis, Napolis (1986)"},{"key":"221_CR5","unstructured":"Buss, S.R.: Bounded arithmetic and constant depth Frege proofs. In: Kraj\u00ed\u010dek, J. (ed.) Complexity of Computations and Proofs (Quaderni di matematica, vol. 13), pp. 153\u2013174 (2004)"},{"key":"221_CR6","doi-asserted-by":"crossref","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. Lond. Math. Soc. 69, 1\u201321 (1994)","journal-title":"Proc. Lond. Math. Soc."},{"key":"221_CR7","doi-asserted-by":"crossref","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. Syst. Sci. 37, 79\u2013100 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"221_CR8","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., Skelly A., Thapen N.: NP search problems in low fragments of bounded arithmetic. J. Symb. Logic 72, 649\u2013672 (2007)","journal-title":"J. Symb. Logic"},{"key":"221_CR9","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0304-3975(91)90200-L","volume":"81","author":"N. Megiddo","year":"1991","unstructured":"Megiddo N., Papadimitriou C.H.: A note on total functions, existence theorems, and computational complexity. Theor. Comp. Sci. 81, 317\u2013324 (1991)","journal-title":"Theor. Comp. Sci."},{"key":"221_CR10","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou C.H.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comp. Syst. Sci. 48, 498\u2013532 (1994)","journal-title":"J. Comp. Syst. Sci."},{"key":"221_CR11","unstructured":"Skelly, A., Thapen, N.: The provable total search problems of bounded arithmetic, Typeset manuscript (2007)"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-010-0221-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-010-0221-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-010-0221-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T11:54:40Z","timestamp":1558612480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-010-0221-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,3]]},"references-count":11,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["221"],"URL":"https:\/\/doi.org\/10.1007\/s00153-010-0221-8","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,3]]}}}