{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:12:33Z","timestamp":1743091953450,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031643088"},{"type":"electronic","value":"9783031643095"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-64309-5_11","type":"book-chapter","created":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T22:01:49Z","timestamp":1719871309000},"page":"126-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Arithmetical Numberings in\u00a0Reverse Mathematics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5834-2770","authenticated-orcid":false,"given":"Nikolay","family":"Bazhenov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5972-0542","authenticated-orcid":false,"given":"Marta","family":"Fiori-Carones","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8259-4441","authenticated-orcid":false,"given":"Manat","family":"Mustafa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-0-387-68546-5_2","volume-title":"New Computational Paradigms","author":"S Badaev","year":"2008","unstructured":"Badaev, S., Goncharov, S.: Computability and numberings. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) New Computational Paradigms, pp. 19\u201334. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-68546-5_2"},{"key":"11_CR2","series-title":"The University Series in Mathematics","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-1-4615-0755-0_2","volume-title":"Computability and Models","author":"S Badaev","year":"2003","unstructured":"Badaev, S., Goncharov, S., Sorbi, A.: Completeness and universality of arithmetical numberings. In: Goncharov, S.S., Cooper, S.B. (eds.) Computability and Models. The University Series in Mathematics, pp. 11\u201344. Springer, New York (2003). https:\/\/doi.org\/10.1007\/978-1-4615-0755-0_2"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Badaev, S.A., Goncharov, S.S.: The theory of numberings: open problems. In: Cholak, P., Lempp, S., Lerman, M., Shore, R. (eds.) Computability Theory and Its Applications, Contemporary Mathematics, vol.\u00a0257, pp. 23\u201338. American Mathematical Society, Providence (2000). https:\/\/doi.org\/10.1090\/conm\/257\/04025","DOI":"10.1090\/conm\/257\/04025"},{"issue":"5","key":"11_CR4","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1012516217265","volume":"40","author":"SA Badaev","year":"2001","unstructured":"Badaev, S.A., Goncharov, S.S.: Rogers semilattices of families of arithmetic sets. Algebra Log. 40(5), 283\u2013291 (2001). https:\/\/doi.org\/10.1023\/A:1012516217265","journal-title":"Algebra Log."},{"issue":"5","key":"11_CR5","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10469-014-9296-3","volume":"53","author":"SA Badaev","year":"2014","unstructured":"Badaev, S.A., Goncharov, S.S.: Generalized computable universal numberings. Algebra Log. 53(5), 355\u2013364 (2014). https:\/\/doi.org\/10.1007\/s10469-014-9296-3","journal-title":"Algebra Log."},{"key":"11_CR6","series-title":"Theory and Applications of Computability","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-030-59234-9_11","volume-title":"Handbook of Computability and Complexity in Analysis","author":"V Brattka","year":"2021","unstructured":"Brattka, V., Gherardi, G., Pauly, A.: Weihrauch complexity in computable analysis. In: Handbook of Computability and Complexity in Analysis. TAC, pp. 367\u2013417. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-59234-9_11"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"797","DOI":"10.2307\/2586713","volume":"63","author":"CT Chong","year":"1998","unstructured":"Chong, C.T., Yang, Y.: $$\\Sigma _2$$ induction and infinite injury priority argument, part I: maximal sets and the jump operator. J. Symb. Log. 63(3), 797\u2013814 (1998). https:\/\/doi.org\/10.2307\/2586713","journal-title":"J. Symb. Log."},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1090\/tran\/6465","volume":"368","author":"FG Dorais","year":"2016","unstructured":"Dorais, F.G., Dzhafarov, D.D., Hirst, J.L., Mileti, J.R., Shafer, P.: On uniform relationships between combinatorial problems. Trans. Am. Math. Soc. 368(2), 1321\u20131359 (2016). https:\/\/doi.org\/10.1090\/tran\/6465","journal-title":"Trans. Am. Math. Soc."},{"key":"11_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-11367-3","volume-title":"Reverse Mathematics: Problems, Reductions, and Proofs","author":"DD Dzhafarov","year":"2022","unstructured":"Dzhafarov, D.D., Mummert, C.: Reverse Mathematics: Problems, Reductions, and Proofs. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-11367-3"},{"issue":"5","key":"11_CR10","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/BF02219286","volume":"7","author":"YL Ershov","year":"1968","unstructured":"Ershov, Y.L.: On computable enumerations. Algebra Log. 7(5), 330\u2013346 (1968). https:\/\/doi.org\/10.1007\/BF02219286","journal-title":"Algebra Log."},{"key":"11_CR11","volume-title":"Theory of Numberings","author":"YL Ershov","year":"1977","unstructured":"Ershov, Y.L.: Theory of Numberings. Nauka, Moscow (1977). In Russian"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Ershov, Y.L.: Theory of numberings. In: Griffor, E.R. (ed.) Handbook of Computability Theory, Studies in Logic and the Foundations of Mathematics, vol.\u00a0140, pp. 473\u2013503. North-Holland, Amsterdam (1999). https:\/\/doi.org\/10.1016\/S0049-237X(99)80030-5","DOI":"10.1016\/S0049-237X(99)80030-5"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Friedberg, R.M.: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication. J. Symb. Log. 23(3), 309\u2013316 (1958). https:\/\/doi.org\/10.2307\/2964290","DOI":"10.2307\/2964290"},{"key":"11_CR14","unstructured":"Friedman, H.: Some systems of second order arithmetic and their use. In: Proceedings of the International Congress of Mathematicians (Vancouver, B. C., 1974), vol. 1, pp. 235\u2013242 (1975)"},{"issue":"6","key":"11_CR15","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF02671553","volume":"36","author":"SS Goncharov","year":"1997","unstructured":"Goncharov, S.S., Sorbi, A.: Generalized computable numerations and nontrivial Rogers semilattices. Algebra Log. 36(6), 359\u2013369 (1997). https:\/\/doi.org\/10.1007\/BF02671553","journal-title":"Algebra Log."},{"key":"11_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/9781316717271","volume-title":"Metamathematics of First-Order Arithmetic, Perspectives in Logic","author":"P H\u00e1jek","year":"2017","unstructured":"H\u00e1jek, P., Pudl\u00e1k, P.: Metamathematics of First-Order Arithmetic, Perspectives in Logic, vol. 3. Cambridge University Press, Cambridge (2017)"},{"key":"11_CR17","volume-title":"Slicing the Truth: On the Computable and Reverse Mathematics of Combinatorial Principles","author":"DR Hirschfeldt","year":"2015","unstructured":"Hirschfeldt, D.R.: Slicing the Truth: On the Computable and Reverse Mathematics of Combinatorial Principles. World Scientific Publishing Co., Hackensack (2015)"},{"key":"11_CR18","volume-title":"Introduction to Metamathematics","author":"SC Kleene","year":"1952","unstructured":"Kleene, S.C.: Introduction to Metamathematics. Van Nostrand, New York (1952)"},{"issue":"4","key":"11_CR19","first-page":"3","volume":"13","author":"AN Kolmogorov","year":"1958","unstructured":"Kolmogorov, A.N., Uspenskii, V.A.: On the definition of an algorithm. Uspehi Mat. Nauk 13(4), 3\u201328 (1958). In Russian","journal-title":"Uspehi Mat. Nauk"},{"issue":"4","key":"11_CR20","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.2178\/jsl.7804060","volume":"78","author":"W Li","year":"2013","unstructured":"Li, W.: Friedberg numbering in fragments of Peano arithmetic and $$\\alpha $$-recursion theory. J. Symb. Log. 78(4), 1135\u20131163 (2013). https:\/\/doi.org\/10.2178\/jsl.7804060","journal-title":"J. Symb. Log."},{"issue":"4","key":"11_CR21","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/BF01146576","volume":"13","author":"SS Marchenkov","year":"1973","unstructured":"Marchenkov, S.S.: Existence of families without positive numerations. Math. Notes 13(4), 360\u2013363 (1973). https:\/\/doi.org\/10.1007\/BF01146576","journal-title":"Math. Notes"},{"issue":"3\u20134","key":"11_CR22","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/BF01976264","volume":"8","author":"MB Pour-El","year":"1965","unstructured":"Pour-El, M.B., Putnam, H.: Recursively enumerable classes and their application to recursive sequences of formal theories. Arch. Math. Logik Grundlagenforsch. 8(3\u20134), 104\u2013121 (1965). https:\/\/doi.org\/10.1007\/BF01976264","journal-title":"Arch. Math. Logik Grundlagenforsch."},{"issue":"3","key":"11_CR23","doi-asserted-by":"publisher","first-page":"331","DOI":"10.2307\/2964292","volume":"23","author":"H Rogers","year":"1958","unstructured":"Rogers, H.: G\u00f6del numberings of partial recursive functions. J. Symb. Logic 23(3), 331\u2013341 (1958). https:\/\/doi.org\/10.2307\/2964292","journal-title":"J. Symb. Logic"},{"key":"11_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581007","volume-title":"Subsystems of Second Order Arithmetic","author":"SG Simpson","year":"2009","unstructured":"Simpson, S.G.: Subsystems of Second Order Arithmetic, 2nd edn. Cambridge University Press, Cambridge (2009)","edition":"2"},{"issue":"3","key":"11_CR25","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.apal.2012.10.014","volume":"164","author":"SG Simpson","year":"2013","unstructured":"Simpson, S.G., Yokoyama, K.: Reverse mathematics and Peano categoricity. Ann. Pure Appl. Logic 164(3), 284\u2013293 (2013). https:\/\/doi.org\/10.1016\/j.apal.2012.10.014","journal-title":"Ann. Pure Appl. Logic"}],"container-title":["Lecture Notes in Computer Science","Twenty Years of Theoretical and Practical Synergies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64309-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T22:02:56Z","timestamp":1719871376000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64309-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031643088","9783031643095"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64309-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"2 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}