{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:50:20Z","timestamp":1742925020091,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031617157"},{"type":"electronic","value":"9783031617164"}],"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-61716-4_14","type":"book-chapter","created":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T03:47:52Z","timestamp":1716954472000},"page":"214-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fixed Point Theorems in\u00a0Computability Theory"],"prefix":"10.1007","author":[{"given":"Sebastiaan A.","family":"Terwijn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"issue":"1\u20132","key":"14_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/malq.201500057","volume":"62","author":"SA Badaev","year":"2016","unstructured":"Badaev, S.A., Sorbi, A.: Weakly precomplete computably enumerable equivalence relations. Math. Log. Q. 62(1\u20132), 111\u2013127 (2016)","journal-title":"Math. Log. Q."},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1515\/tmj-2017-0107","volume":"10","author":"A Bauer","year":"2017","unstructured":"Bauer, A.: On fixed-point theorems in synthetic computability. Tbilisi Math. J. 10(3), 167\u2013181 (2017)","journal-title":"Tbilisi Math. J."},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-319-50062-1_25","volume-title":"Computability and Complexity","author":"U Andrews","year":"2017","unstructured":"Andrews, U., Badaev, S., Sorbi, A.: A survey on universal computably enumerable equivalence relations. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds.) Computability and Complexity. LNCS, vol. 10010, pp. 418\u2013451. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-50062-1_25"},{"key":"14_CR4","unstructured":"Arslanov, M.M.: On some generalizations of the fixed point theorem. Sov. Math. (Izvestiya VUZ. Matematika) 25(5), 1\u201310 (1981). (English translation)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1134\/S1995080221040041","volume":"42","author":"MM Arslanov","year":"2021","unstructured":"Arslanov, M.M.: Fixed-point selection functions. Lobachevskii J. Math. 42, 685\u2013692 (2021)","journal-title":"Lobachevskii J. Math."},{"key":"14_CR6","unstructured":"Barendregt, H.P.: The Lambda Calculus. Studies in Logic and the Foundations of Mathematics, vol. 103, 2nd edn. North-Holland, Amsterdam (1984)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1016\/j.apal.2019.04.013","volume":"170","author":"HP Barendregt","year":"2019","unstructured":"Barendregt, H.P., Terwijn, S.A.: Fixed point theorems for precomplete numberings. Ann. Pure Appl. Logic 170, 1151\u20131161 (2019)","journal-title":"Ann. Pure Appl. Logic"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.tcs.2022.04.054","volume":"925","author":"HP Barendregt","year":"2022","unstructured":"Barendregt, H.P., Terwijn, S.A.: Partial combinatory algebra and generalized numberings. Theoret. Comput. Sci. 925, 37\u201344 (2022)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"529","DOI":"10.2307\/2273443","volume":"48","author":"C Bernardi","year":"1983","unstructured":"Bernardi, C., Sorbi, A.: Classifying positive equivalence relations. J. Symb. Log. 48(3), 529\u2013538 (1983)","journal-title":"J. Symb. Log."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.apal.2008.04.005","volume":"156","author":"JRB Cockett","year":"2008","unstructured":"Cockett, J.R.B., Hofstra, P.J.W.: Introduction to Turing categories. Ann. Pure Appl. Logic 156, 183\u2013209 (2008)","journal-title":"Ann. Pure Appl. Logic"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1002\/malq.19750210164","volume":"21","author":"YL Ershov","year":"1975","unstructured":"Ershov, Y.L.: Theorie der Numerierungen II. Zeitschrift f\u00fcr Math. Logik Grundlagen Math. 21, 473\u2013584 (1975)","journal-title":"Zeitschrift f\u00fcr Math. Logik Grundlagen Math."},{"key":"14_CR12","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/bfb0062852","volume-title":"Algebra and Logic","author":"S Feferman","year":"1975","unstructured":"Feferman, S.: A language and axioms for explicit mathematics. In: Crossley, J.N. (ed.) Algebra and Logic. LNM, vol. 450, pp. 87\u2013139. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/bfb0062852"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.3233\/COM-210344","volume":"11","author":"A Golov","year":"2022","unstructured":"Golov, A., Terwijn, S.A.: Fixpoints and relative precompleteness. Computability 11(2), 135\u2013146 (2022)","journal-title":"Computability"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1215\/00294527-2023-0002","volume":"64","author":"A Golov","year":"2023","unstructured":"Golov, A., Terwijn, S.A.: Embeddings between partial combinatory algebras. Notre Dame J. Formal Logic 64(1), 129\u2013158 (2023)","journal-title":"Notre Dame J. Formal Logic"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Jockusch Jr., C.G., Lerman, M., Soare, R.I., Solovay, R.M.: Recursively enumerable sets modulo iterated jumps and extensions of Arslanov\u2019s completeness criterion. J. Symb. Logic 54(4), 1288\u20131323 (1989)","DOI":"10.1017\/S0022481200041104"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Jockusch Jr., C.G., Soare, R.I.: $$\\Pi ^0_1$$ classes and degrees of theories. Trans. Am. Math. Soc. 173, 33\u201356 (1972)","DOI":"10.1090\/S0002-9947-1972-0316227-0"},{"key":"14_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4190-4","volume-title":"Classical Descriptive Set Theory","author":"AS Kechris","year":"1995","unstructured":"Kechris, A.S.: Classical Descriptive Set Theory. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/978-1-4612-4190-4"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2267778","volume":"3","author":"SC Kleene","year":"1938","unstructured":"Kleene, S.C.: On notation for ordinal numbers. J. Symb. Log. 3, 150\u2013155 (1938)","journal-title":"J. Symb. Log."},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Lawvere, F.W.: Diagonal arguments and cartesian closed categories. In: Category Theory, Homology Theory and their Applications II. LNM, vol. 92, pp. 134\u2013145. Springer, Heidelberg (1969). https:\/\/doi.org\/10.1007\/BFb0080769. Republished in: Reprints in Theory and Applications of Categories, No. 15, 1\u201313 (2006)","DOI":"10.1007\/BFb0080769"},{"key":"14_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47992-6","volume-title":"Higher-Order Computability","author":"J Longley","year":"2015","unstructured":"Longley, J., Normann, D.: Higher-Order Computability. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47992-6"},{"key":"14_CR21","unstructured":"Moschovakis, Y.N.: Descriptive Set Theory. North-Holland (1980)"},{"issue":"2","key":"14_CR22","doi-asserted-by":"publisher","first-page":"189","DOI":"10.2178\/bsl\/1286889124","volume":"16","author":"YN Moschovakis","year":"2010","unstructured":"Moschovakis, Y.N.: Kleene\u2019s amazing second recursion theorem. Bull. Symb. Logic 16(2), 189\u2013239 (2010)","journal-title":"Bull. Symb. Logic"},{"key":"14_CR23","unstructured":"Odifreddi, P.G.: Classical Recursion Theory, vol.\u00a01. Studies in Logic and the Foundations of Mathematics, vol.\u00a0125. North-Holland (1989)"},{"key":"14_CR24","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Realizability: An Introduction to Its Categorical Side","author":"J van Oosten","year":"2008","unstructured":"van Oosten, J.: Realizability: An Introduction to Its Categorical Side. Studies in Logic and the Foundations of Mathematics, vol. 152. Elsevier, Amsterdam (2008)"},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1305\/ndjfl\/1093890812","volume":"14","author":"JC Owings","year":"1973","unstructured":"Owings, J.C.: Diagonalization and the recursion theorem. Notre Dame J. Formal Logic 14, 95\u201399 (1973)","journal-title":"Notre Dame J. Formal Logic"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Selivanov, V.: Index sets of quotient objects of the Post numeration. Algebra Logika 27(3), 343\u2013358 (1988). (English translation 1989)","DOI":"10.1007\/BF01978567"},{"issue":"3","key":"14_CR27","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1017\/jsl.2021.50","volume":"86","author":"P Shafer","year":"2021","unstructured":"Shafer, P., Terwijn, S.A.: Ordinal analysis of partial combinatory algebras. J. Symb. Log. 86(3), 1154\u20131188 (2021)","journal-title":"J. Symb. Log."},{"key":"14_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"RI Soare","year":"1987","unstructured":"Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, Heidelberg (1987)"},{"issue":"4","key":"14_CR29","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.1017\/jsl.2018.52","volume":"83","author":"SA Terwijn","year":"2018","unstructured":"Terwijn, S.A.: Generalizations of the recursion theorem. J. Symb. Log. 83(4), 1683\u20131690 (2018)","journal-title":"J. Symb. Log."},{"issue":"5","key":"14_CR30","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00153-020-00712-z","volume":"59","author":"SA Terwijn","year":"2020","unstructured":"Terwijn, S.A.: The noneffectivity of Arslanov\u2019s completeness criterion and related theorems. Arch. Math. Logic 59(5), 703\u2013713 (2020)","journal-title":"Arch. Math. Logic"},{"issue":"3\u20134","key":"14_CR31","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1017\/bsl.2020.46","volume":"26","author":"SA Terwijn","year":"2020","unstructured":"Terwijn, S.A.: Computability in partial combinatory algebras. Bull. Symb. Logic 26(3\u20134), 224\u2013240 (2020)","journal-title":"Bull. Symb. Logic"},{"key":"14_CR32","unstructured":"Visser, A.: Numerations, $$\\lambda $$-calculus, and arithmetic. In: Seldin, J.P., Hindley, J.R. (eds.) To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 259\u2013284. Academic Press (1980)"},{"issue":"3","key":"14_CR33","doi-asserted-by":"publisher","first-page":"362","DOI":"10.2178\/bsl\/1058448677","volume":"9","author":"NS Yanofsky","year":"2003","unstructured":"Yanofsky, N.S.: A universal approach to self-referential paradoxes, incompleteness and fixed points. Bull. Symb. Logic 9(3), 362\u2013386 (2003)","journal-title":"Bull. Symb. Logic"}],"container-title":["Lecture Notes in Computer Science","Logics and Type Systems in Theory and Practice"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-61716-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T03:49:46Z","timestamp":1716954586000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-61716-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031617157","9783031617164"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-61716-4_14","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":"22 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}