{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:40:43Z","timestamp":1725496843204},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665366"},{"type":"electronic","value":"9783540481683"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48168-0_28","type":"book-chapter","created":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T11:30:26Z","timestamp":1196508626000},"page":"389-404","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Open Least Element Principle and Bounded Query Computation"],"prefix":"10.1007","author":[{"given":"L. D.","family":"Beklemishev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0168-0072(96)00045-0","volume":"85","author":"L.D. Beklemishev","year":"1997","unstructured":"L.D. Beklemishev. Induction rules, reflection principles, and provablyrecursiv e functions. Annals of Pure and Applied Logic, 85:193\u2013242, 1997.","journal-title":"Annals of Pure and Applied Logic"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s001530050099","volume":"37","author":"L.D. Beklemishev","year":"1998","unstructured":"L.D. Beklemishev. A proof-theoretic analysis of collection. Archive for Mathematical Logic, 37:275\u2013296, 1998.","journal-title":"Archive for Mathematical Logic"},{"key":"28_CR3","first-page":"1","volume-title":"Handbook of Proof Theory","author":"S.R. Buss","year":"1998","unstructured":"S.R. Buss. Introduction to Proof Theory. In S.R. Buss, editor, Handbook of Proof Theory, pages 1\u201378. Elsevier, North-Holland, Amsterdam, 1998."},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/oso\/9780198536901.001.0001","volume-title":"Arithmetic, Proof Theory, and Computational Complexity","author":"P. Clote","year":"1993","unstructured":"P. Clote and J. Kraj\u00ed\u010dek. Open problems. In P. Clote and J. Kraj\u00ed\u010dek, editors, Arithmetic, Proof Theory, and Computational Complexity, pages 1\u201319. Oxford UniversityPress, Oxford, 1993."},{"key":"28_CR5","first-page":"187","volume-title":"Logic and algorithmic (Zurich, 1980), (Monograph. Enseign. Math., 30)","author":"H. Gaifman","year":"1982","unstructured":"H. Gaifman and C. Dimitracopoulos. Fragments of Peano\u2019s arithmetic and the MDRP theorem. In Logic and algorithmic (Zurich, 1980), (Monograph. Enseign. Math., 30), pages 187\u2013206. Gen\u00e8ve, Universityof Gen\u00e8ve, 1982."},{"key":"28_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-22156-3","volume-title":"Metamathematics of First Order Arithmetic","author":"P. H\u00e1jek","year":"1993","unstructured":"P. H\u00e1jek and P. Pudl\u00e1k. Metamathematics of First Order Arithmetic. Springer-Verlag, Berlin, Heidelberg, New-York, 1993."},{"key":"28_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":"J. Kraj\u00ed\u010dek. Bounded arithmetic, Propositional logic, and Complexity theory. Cambridge UniversityPress, Cambridge, 1995."},{"key":"28_CR8","unstructured":"L. Kristiansen. Fragments of Peano arithmetic and subrecursive degrees. Manuscript, 1998."},{"issue":"4","key":"28_CR9","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/malq.19680142106","volume":"14","author":"C. Parsons","year":"1968","unstructured":"C. Parsons. Hierarchies of primitive recursive functions. Zeitschrift f. math. Logik und Grundlagen d. Math., 14(4):357\u2013376, 1968.","journal-title":"Zeitschrift f. math. Logik und Grundlagen d. Math"},{"key":"28_CR10","volume-title":"Subrecursion: Functions and Hierarchies","author":"H.E. Rose","year":"1984","unstructured":"H.E. Rose. Subrecursion: Functions and Hierarchies. Clarendon Press, Oxford, 1984."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48168-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T23:12:46Z","timestamp":1708384366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48168-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665366","9783540481683"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-48168-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"13 May 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}