{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T14:40:10Z","timestamp":1716475210056},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2014,1,24]],"date-time":"2014-01-24T00:00:00Z","timestamp":1390521600000},"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":[[2014,5]]},"DOI":"10.1007\/s00153-014-0368-9","type":"journal-article","created":{"date-parts":[[2014,1,23]],"date-time":"2014-01-23T06:27:28Z","timestamp":1390458448000},"page":"327-349","source":"Crossref","is-referenced-by-count":2,"title":["On axiom schemes for T-provably $${\\Delta_{1}}$$ \u0394 1 formulas"],"prefix":"10.1007","volume":"53","author":[{"given":"A.","family":"Cord\u00f3n-Franco","sequence":"first","affiliation":[]},{"given":"A.","family":"Fern\u00e1ndez-Margarit","sequence":"additional","affiliation":[]},{"given":"F. F.","family":"Lara-Mart\u00edn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,1,24]]},"reference":[{"key":"368_CR1","doi-asserted-by":"crossref","first-page":"649","DOI":"10.2178\/jsl\/1333566643","volume":"77","author":"Z. Adamowicz","year":"2012","unstructured":"Adamowicz Z., Ko\u0142odziejczyk L.A., Paris J.B.: Truth definitions without exponentiation and the $${\\Sigma_1}$$ \u03a3 1 collection scheme. J. Symb. Logic 77, 649\u2013655 (2012)","journal-title":"J. Symb. Logic"},{"key":"368_CR2","doi-asserted-by":"crossref","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. Ann. Pure Appl. Logic 118, 219\u2013234 (2002)","journal-title":"Ann. Pure Appl. Logic"},{"key":"368_CR3","doi-asserted-by":"crossref","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. Ann. Pure Appl. Logic 85, 193\u2013242 (1997)","journal-title":"Ann. Pure Appl. Logic"},{"key":"368_CR4","doi-asserted-by":"crossref","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. Arch. Math. Logic 37, 275\u2013296 (1998)","journal-title":"Arch. Math. Logic"},{"key":"368_CR5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.2178\/jsl\/1045861504","volume":"68","author":"L.D. Beklemishev","year":"2003","unstructured":"Beklemishev L.D.: On the induction scheme for decidable predicates. J. Symb. Logic 68, 17\u201334 (2003)","journal-title":"J. Symb. Logic"},{"key":"368_CR6","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: Clote, P., Kraj\u00ed\u010dek, J. (eds) Arithmetic, Proof Theory, and Computational Complexity, pp. 1\u201319. Oxford University Press, Oxford (1993)"},{"key":"368_CR7","doi-asserted-by":"crossref","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 $${\\Delta_{n+1}(T)}$$ \u0394 n + 1 ( T ) -induction. Arch. Math. Logic 43, 371\u2013398 (2004)","journal-title":"Arch. Math. Logic"},{"key":"368_CR8","doi-asserted-by":"crossref","unstructured":"Cord\u00f3n-Franco, A., Fern\u00e1ndez-Margarit, A., Lara-Mart\u00edn, F.F.: Provably total primitive recursive functions: theories with induction. In: Marcinkowski, J., Tarlecki, A. (eds.) Computer Science Logic, 18th International Workshop, CSL 2004, Karpacz, Poland, Sept 20\u201324, 2004, Proceedings, pp. 355\u2013369, Lecture Notes in Comput. Sci. 3210, Springer, Berlin, Heidelberg (2004)","DOI":"10.1007\/978-3-540-30124-0_28"},{"key":"368_CR9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/malq.200410034","volume":"51","author":"A. Cord\u00f3n-Franco","year":"2005","unstructured":"Cord\u00f3n-Franco A., Fern\u00e1ndez-Margarit A., Lara-Mart\u00edn F.F.: Fragments of Arithmetic and true sentences. MLQ Math. Log. Q. 51, 313\u2013328 (2005)","journal-title":"MLQ Math. Log. Q."},{"key":"368_CR10","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1002\/malq.201010013","volume":"57","author":"A. Cord\u00f3n-Franco","year":"2011","unstructured":"Cord\u00f3n-Franco A., Fern\u00e1ndez-Margarit A., Lara-Mart\u00edn F.F.: A note on parameter free $${\\Pi_1}$$ \u03a0 1 -induction and restricted exponentiation. MLQ Math. Log. Q. 57, 444\u2013455 (2011)","journal-title":"MLQ Math. Log. Q."},{"key":"368_CR11","doi-asserted-by":"crossref","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 $${\\Delta_{n+1}(T)}$$ \u0394 n + 1 ( T ) -formulas. Arch. Math. Logic 43, 505\u2013541 (2004)","journal-title":"Arch. Math. Logic"},{"key":"368_CR12","doi-asserted-by":"crossref","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., Pudl\u00e1k P.: Metamathematics of First-Order Arithmetic. Springer, Berlin, Heidelberg (1993)"},{"key":"368_CR13","unstructured":"Kaye, R.: Diophantine and parameter-free induction. Ph.D. thesis, University of Manchester (1987)"},{"key":"368_CR14","doi-asserted-by":"crossref","first-page":"1082","DOI":"10.2307\/2274606","volume":"53","author":"R. Kaye","year":"1988","unstructured":"Kaye R., Paris J., Dimitracopoulos C.: On parameter free induction schemas. J. Symb. Logic 53, 1082\u20131097 (1988)","journal-title":"J. Symb. Logic"},{"key":"368_CR15","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/malq.19680140702","volume":"14","author":"H. Kreisel","year":"1968","unstructured":"Kreisel H., L\u00e9vy A.: Reflection principles and their use for establising the complexity of axiomatic systems. Arch. Math. Logik Grundlag. 14, 97\u2013142 (1968)","journal-title":"Arch. Math. Logik Grundlag."},{"key":"368_CR16","unstructured":"Lessan, H.: Models of Arithmetic. Ph.D. thesis, University of Manchester (1978)"},{"key":"368_CR17","first-page":"285","volume-title":"Logic Colloquium 77, Studies in Logic and the Foundations of Mathematics 96.","author":"J.B. Paris","year":"1978","unstructured":"Paris J.B., Kirby L.: $${\\Sigma_n}$$ \u03a3 n -Collection schemas in arithmetic. In: Macintyre, A., Pacholski, L., Paris, J. (eds) Logic Colloquium 77, Studies in Logic and the Foundations of Mathematics 96., pp. 285\u2013296. North-Holland, Amsterdam (1978)"},{"key":"368_CR18","doi-asserted-by":"crossref","first-page":"466","DOI":"10.2307\/2272731","volume":"37","author":"C. Parsons","year":"1972","unstructured":"Parsons C.: On n-quantifier induction. J. Symb. Logic 37, 466\u2013482 (1972)","journal-title":"J. Symb. Logic"},{"key":"368_CR19","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":"368_CR20","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1093\/logcom\/exm036","volume":"17","author":"A. Sirokofskich","year":"2007","unstructured":"Sirokofskich A., Dimitracopoulos C.: On a problem of J. Paris. J. Log. Comput. 17, 1099\u20131107 (2007)","journal-title":"J. Log. Comput."},{"key":"368_CR21","doi-asserted-by":"crossref","first-page":"2449","DOI":"10.1090\/S0002-9939-04-07294-6","volume":"132","author":"T. Slaman","year":"2004","unstructured":"Slaman T.: $${\\Sigma_n}$$ \u03a3 n -bounding and $${\\Delta_n}$$ \u0394 n -induction. Proc. Am. Math. Soc. 132, 2449\u20132456 (2004)","journal-title":"Proc. Am. Math. Soc."},{"key":"368_CR22","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.2307\/2275705","volume":"59","author":"G. Takeuti","year":"1994","unstructured":"Takeuti G.: Grzegorcyk\u2019s hierarchy and Iep $${\\Sigma_1}$$ \u03a3 1 . J. Symb. Logic 59, 1274\u20131284 (1994)","journal-title":"J. Symb. Logic"},{"key":"368_CR23","doi-asserted-by":"crossref","first-page":"79","DOI":"10.4064\/fm186-1-6","volume":"186","author":"N. Thapen","year":"2005","unstructured":"Thapen N.: A note on $${\\Delta_1}$$ \u0394 1 induction and $${\\Sigma_1}$$ \u03a3 1 collection. Fund. Math. 186, 79\u201384 (2005)","journal-title":"Fund. Math."},{"key":"368_CR24","first-page":"143","volume-title":"Logic, Methodology, and Philosophy of Science VIII, Moscow, 1987","author":"A.J. Wilkie","year":"1989","unstructured":"Wilkie A.J., Paris J.B.: On the existence of end-extensions of models of bounded induction. In: Fenstad, J.E., Frolov, I.T., Hilpinen, R. (eds) Logic, Methodology, and Philosophy of Science VIII, Moscow, 1987, pp. 143\u2013161. North-Holland, Amsterdam (1989)"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-014-0368-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-014-0368-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-014-0368-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T14:15:35Z","timestamp":1716473735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-014-0368-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,24]]},"references-count":24,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["368"],"URL":"https:\/\/doi.org\/10.1007\/s00153-014-0368-9","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,24]]}}}