{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:17:15Z","timestamp":1725549435325},"publisher-location":"Berlin, Heidelberg","reference-count":17,"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_28","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T17:27:59Z","timestamp":1267550879000},"page":"355-369","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Provably Total Primitive Recursive Functions: Theories with Induction"],"prefix":"10.1007","author":[{"given":"Andr\u00e9s","family":"Cord\u00f3n-Franco","sequence":"first","affiliation":[]},{"given":"Alejandro","family":"Fern\u00e1ndez-Margarit","sequence":"additional","affiliation":[]},{"given":"F. F\u00e9lix","family":"Lara-Mart\u00edn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,9,9]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0168-0072(02)00030-1","volume":"118","author":"J. Avigad","year":"2002","unstructured":"Avigad, J.: Saturated models of universal theories. Annals of Pure and Applied Logic\u00a0118, 219\u2013234 (2002)","journal-title":"Annals of Pure and Applied Logic"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0168-0072(96)00045-0","volume":"85","author":"L.D. Beklemishev","year":"1997","unstructured":"Beklemishev, L.D.: Induction rules, reflection principles, and provably recursive functions. Annals of Pure and Applied Logic\u00a085, 193\u2013242 (1997)","journal-title":"Annals of Pure and Applied Logic"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s001530050099","volume":"37","author":"L.D. Beklemishev","year":"1998","unstructured":"Beklemishev, L.D.: A proof-theoretic analysis of collection. Archive for Mathematical Logic\u00a037, 275\u2013296 (1998)","journal-title":"Archive for Mathematical Logic"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/3-540-48168-0_28","volume-title":"Computer Science Logic","author":"L.D. Beklemishev","year":"1999","unstructured":"Beklemishev, L.D.: Open Least Element Principle and Bounded Query Computation. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 389\u2013404. Springer, Heidelberg (1999)"},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.2178\/jsl\/1045861504","volume":"68","author":"L.D. Beklemishev","year":"2003","unstructured":"Beklemishev, L.D.: On the induction schema for decidable predicates. The Journal of Symbolic Logic\u00a068(1), 17\u201334 (2003)","journal-title":"The Journal of Symbolic Logic"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/S0049-237X(99)80033-0","volume-title":"Handbook of Computability Theory","author":"P. Clote","year":"1999","unstructured":"Clote, P.: Computation Models and Function Algebras. In: Handbook of Computability Theory, pp. 589\u2013681. North-Holland, Amsterdam (1999)"},{"key":"28_CR7","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":"Clote, P., Kraj\u00ed\u010dek, J.: Open Problems. In: Arithmetic, Proof Theory and Computational Complexity, pp. 1\u201319. Clarendon Press, Oxford (1993)"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s00153-003-0198-7","volume":"43","author":"A. Cord\u00f3n Franco","year":"2004","unstructured":"Cord\u00f3n Franco, A., Fern\u00e1ndez Margarit, A., Lara Mart\u00edn, F.F.: On the quantifier complexity of \u0394n+1(T)\u2013induction. Archive for Mathematical Logic\u00a043, 371\u2013398 (2004)","journal-title":"Archive for Mathematical Logic"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s00153-003-0197-8","volume":"43","author":"A. Fern\u00e1ndez Margarit","year":"2004","unstructured":"Fern\u00e1ndez Margarit, A., Lara Mart\u00edn, F.F.: Induction, minimization and collection for \u0394n+1(T)\u2013formulas. Archive for Mathematical Logic\u00a043, 505\u2013541 (2004)","journal-title":"Archive for Mathematical Logic"},{"key":"28_CR10","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":"H\u00e1jek, P., Pudlak, P.: Metamathematics of First-Order Arithmetic. Springer, Heidelberg (1993)"},{"key":"28_CR11","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198532132.001.0001","volume-title":"Models of Peano Arithmetic","author":"R. Kaye","year":"1991","unstructured":"Kaye, R.: Models of Peano Arithmetic. Clarendon Press, Oxford (1991)"},{"key":"28_CR12","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":"Kraj\u00ed\u010dek, J.: Bounded arithmetic, Propositional logic, and Complexity theory. Cambridge University Press, Cambridge (1995)"},{"key":"28_CR13","volume-title":"Subrecursion: Functions and hierarchies","author":"H.E. Rose","year":"1984","unstructured":"Rose, H.E.: Subrecursion: Functions and hierarchies. Clarendon Press, Oxford (1984)"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BF01621477","volume":"30","author":"W. Sieg","year":"1991","unstructured":"Sieg, W.: Herbrand analyses. Archive for Mathematical Logic\u00a030, 409\u2013441 (1991)","journal-title":"Archive for Mathematical Logic"},{"issue":"8","key":"28_CR15","doi-asserted-by":"publisher","first-page":"2449","DOI":"10.1090\/S0002-9939-04-07294-6","volume":"132","author":"T. Slaman","year":"2004","unstructured":"Slaman, T.: \u03a3n\u2013bounding and \u0394n\u2013induction. Proceedings of the American Mathematical Society\u00a0132(8), 2449\u20132456 (2004)","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"4","key":"28_CR16","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.2307\/2275705","volume":"59","author":"G. Takeuti","year":"1994","unstructured":"Takeuti, G.: Grzegorcyk\u2019s hierarchy and Iep\u03a31. The Journal of Symbolic Logic\u00a059(4), 1274\u20131284 (1994)","journal-title":"The Journal of Symbolic Logic"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0168-0072(87)90066-2","volume":"35","author":"A. Wilkie","year":"1987","unstructured":"Wilkie, A., Paris, J.B.: On the scheme of induction for bounded arithmetic formulas. Annals of Pure and Applied Logic\u00a035, 261\u2013302 (1987)","journal-title":"Annals of Pure and Applied 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_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,24]],"date-time":"2024-03-24T15:02:34Z","timestamp":1711292554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30124-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230243","9783540301240"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30124-0_28","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"}}]}}