{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:42:58Z","timestamp":1760028178773,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T00:00:00Z","timestamp":1697587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T00:00:00Z","timestamp":1697587200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004561","name":"Ministry of Education and Science of the Republic of Kazakhstan","doi-asserted-by":"publisher","award":["AP08856834","AP08856834","AP08856834"],"award-info":[{"award-number":["AP08856834","AP08856834","AP08856834"]}],"id":[{"id":"10.13039\/501100004561","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012190","name":"Ministry of Science and Higher Education of the Russian Federation","doi-asserted-by":"publisher","award":["075-15-2022-281"],"award-info":[{"award-number":["075-15-2022-281"]}],"id":[{"id":"10.13039\/501100012190","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012632","name":"Nazarbayev University","doi-asserted-by":"publisher","award":["021220FD3851"],"award-info":[{"award-number":["021220FD3851"]}],"id":[{"id":"10.13039\/501100012632","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s00153-023-00896-0","type":"journal-article","created":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T08:02:39Z","timestamp":1697616159000},"page":"259-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On diagonal functions for equivalence relations"],"prefix":"10.1007","volume":"63","author":[{"given":"Serikzhan A.","family":"Badaev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolay A.","family":"Bazhenov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Birzhan S.","family":"Kalmurzayev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manat","family":"Mustafa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,18]]},"reference":[{"issue":"1","key":"896_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1017\/jsl.2019.39","volume":"85","author":"U Andrews","year":"2020","unstructured":"Andrews, U., Badaev, S.A.: On isomorphism classes of computably enumerable equivalence relations. J. Symb. Log. 85(1), 61\u201386 (2020)","journal-title":"J. Symb. Log."},{"key":"896_CR2","first-page":"418","volume-title":"Computability and Complexity\u2014Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, Volume 10010 of Lecture Notes Computer Science","author":"U Andrews","year":"2017","unstructured":"Andrews, U., Badaev, S.A., Sorbi, A.: A survey on universal computably enumerable equivalence relations. In: Day, A.R., Fellows, M.R., Greenberg, N., Khoussainov, B., Melnikov, A.G., Rosamond, F.A. (eds.) Computability and Complexity\u2014Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, Volume 10010 of Lecture Notes Computer Science, pp. 418\u2013451. Springer, Cham (2017)"},{"issue":"5","key":"896_CR3","first-page":"1","volume":"25","author":"MM Arslanov","year":"1981","unstructured":"Arslanov, M.M.: On some generalizations of a fixed point theorem. Sov. Math. 25(5), 1\u201310 (1981)","journal-title":"Sov. Math."},{"issue":"1","key":"896_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01980603","volume":"28","author":"MM Arslanov","year":"1989","unstructured":"Arslanov, M.M.: Completeness in the arithmetical hierarchy and fixed points. Algebra Logic 28(1), 1\u20139 (1989)","journal-title":"Algebra Logic"},{"issue":"4","key":"896_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(4), 685\u2013692 (2021)","journal-title":"Lobachevskii J. Math."},{"issue":"3\u20134","key":"896_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.3233\/COM-180098","volume":"8","author":"U Andrews","year":"2019","unstructured":"Andrews, U., Sorbi, A.: Joins and meets in the structure of Ceers. Computability 8(3\u20134), 193\u2013241 (2019)","journal-title":"Computability"},{"issue":"2","key":"896_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF00972779","volume":"32","author":"SA Badaev","year":"1991","unstructured":"Badaev, S.A.: On weakly precomplete positive equivalences. Sib. Math. J. 32(2), 321\u2013323 (1991)","journal-title":"Sib. Math. J."},{"issue":"1","key":"896_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1134\/S0037446618010032","volume":"59","author":"NA Bazhenov","year":"2018","unstructured":"Bazhenov, N.A., Kalmurzaev, B.S.: On dark computably enumerable equivalence relations. Sib. Math. J. 59(1), 22\u201330 (2018)","journal-title":"Sib. Math. J."},{"issue":"3","key":"896_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10469-019-09538-y","volume":"58","author":"NA Bazhenov","year":"2019","unstructured":"Bazhenov, N.A., Kalmurzaev, B.S.: Weakly precomplete equivalence relations in the Ershov hierarchy. Algebra Logic 58(3), 199\u2013213 (2019)","journal-title":"Algebra Logic"},{"issue":"3","key":"896_CR10","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."},{"issue":"1\u20132","key":"896_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/malq.201500057","volume":"62","author":"S Badaev","year":"2016","unstructured":"Badaev, S., Sorbi, A.: Weakly precomplete computably enumerable equivalence relations. Math. Log. Q. 62(1\u20132), 111\u2013127 (2016)","journal-title":"Math. Log. Q."},{"issue":"10","key":"896_CR12","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1016\/j.apal.2019.04.013","volume":"170","author":"H Barendregt","year":"2019","unstructured":"Barendregt, H., Terwijn, S.A.: Fixed point theorems for precomplete numberings. Ann. Pure Appl. Logic 170(10), 1151\u20131161 (2019)","journal-title":"Ann. Pure Appl. Logic"},{"key":"896_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic Randomness and Complexity","author":"RG Downey","year":"2010","unstructured":"Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, New York (2010)"},{"key":"896_CR14","doi-asserted-by":"publisher","first-page":"357","DOI":"10.4153\/CJM-1958-035-x","volume":"10","author":"JCE Dekker","year":"1958","unstructured":"Dekker, J.C.E., Myhill, J.: Retraceable sets. Can. J. Math. 10, 357\u2013373 (1958)","journal-title":"Can. J. Math."},{"issue":"1","key":"896_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02218750","volume":"7","author":"YuL Ershov","year":"1968","unstructured":"Ershov, Yu.L.: A hierarchy of sets. I. Algebra Logic 7(1), 25\u201343 (1968)","journal-title":"Algebra Logic"},{"issue":"4","key":"896_CR16","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/BF02218664","volume":"7","author":"YuL Ershov","year":"1968","unstructured":"Ershov, Yu.L.: On a hierarchy of sets. II. Algebra Logic 7(4), 212\u2013232 (1968)","journal-title":"Algebra Logic"},{"issue":"1","key":"896_CR17","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/BF02219847","volume":"9","author":"YuL Ershov","year":"1970","unstructured":"Ershov, Yu.L.: On a hierarchy of sets. III. Algebra Logic 9(1), 20\u201331 (1970)","journal-title":"Algebra Logic"},{"key":"896_CR18","volume-title":"Theory of Numberings","author":"YuL Ershov","year":"1977","unstructured":"Ershov, Yu.L.: Theory of Numberings. Nauka, Moscow (1977). (in Russian)"},{"issue":"2","key":"896_CR19","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":"4","key":"896_CR20","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.2307\/2274816","volume":"54","author":"CG Jockusch Jr","year":"1989","unstructured":"Jockusch, C.G., Jr., Lerman, M., Soare, R.I., Solovay, R.: Recursively enumerable sets modulo iterated jumps and extensions of Arslanov\u2019s completeness criterion. J. Symb. Log. 54(4), 1288\u20131323 (1989)","journal-title":"J. Symb. Log."},{"key":"896_CR21","first-page":"191","volume-title":"Logic, Methodology and Philosophy of Science VIII, Volume 126 of Studies in Logic and the Foundations of Mathematics","author":"CG Jockusch Jr","year":"1989","unstructured":"Jockusch, C.G., Jr.: Degrees of functions with no fixed points. In: Fenstad, J.E., Frolov, I.T., Hilpinen, R. (eds.) Logic, Methodology and Philosophy of Science VIII, Volume 126 of Studies in Logic and the Foundations of Mathematics, pp. 191\u2013201. Elsevier, Amsterdam (1989)"},{"key":"896_CR22","first-page":"33","volume":"173","author":"CG Jockusch Jr","year":"1972","unstructured":"Jockusch, C.G., Jr., Soare, R.I.: $$\\Pi ^0_1$$ classes and degrees of theories. Trans. Am. Math. Soc. 173, 33\u201356 (1972)","journal-title":"Trans. Am. Math. Soc."},{"issue":"4","key":"896_CR23","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(4), 150\u2013155 (1938)","journal-title":"J. Symb. Log."},{"key":"896_CR24","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BFb0076224","volume-title":"Recursion Theory Week","author":"A Ku\u010dera","year":"1985","unstructured":"Ku\u010dera, A.: Measure, $$\\Pi ^0_1$$-classes and complete extensions of PA. In: Ebbinghaus, H.-D., M\u00fcller, G.H., Sacks, G.E. (eds.) Recursion Theory Week. Lecture Notes in Mathematics, vol. 1141, pp. 245\u2013259. Springer, Berlin (1985)"},{"key":"896_CR25","unstructured":"Lempp, S.: Priority arguments in computability theory, model theory, and complexity theory. Lectures Notes (2012)"},{"issue":"2","key":"896_CR26","first-page":"4","volume":"2","author":"AI Mal\u2019tsev","year":"1963","unstructured":"Mal\u2019tsev, A.I.: Sets with complete numberings. Algebra Logic 2(2), 4\u201329 (1963). (in Russian)","journal-title":"Algebra Logic"},{"key":"896_CR27","first-page":"407","volume":"7","author":"AA Muchnik","year":"1958","unstructured":"Muchnik, A.A.: Isomorphism of systems of recursively enumerable sets with effective properties. Tr. Mosk. Mat. Obs. 7, 407\u2013412 (1958). (in Russian)","journal-title":"Tr. Mosk. Mat. Obs."},{"issue":"1","key":"896_CR28","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01229443","volume":"51","author":"VL Selivanov","year":"1992","unstructured":"Selivanov, V.L.: Precomplete numberings and functions without fixed points. Math. Notes 51(1), 95\u201399 (1992)","journal-title":"Math. Notes"},{"issue":"1","key":"896_CR29","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/s10958-021-05422-2","volume":"256","author":"VL Selivanov","year":"2021","unstructured":"Selivanov, V.L.: Precomplete numberings. J. Math. Sci. 256(1), 96\u2013124 (2021)","journal-title":"J. Math. Sci."},{"key":"896_CR30","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, Berlin (1987)"},{"key":"896_CR31","doi-asserted-by":"crossref","unstructured":"Stephan, F., Yang, Y., Yu, L.: Turing degrees and the Ershov hierarchy. In: Arai, T., Brendle, J., Kikyo, H., Chong, C.T., Downey, R., Feng, Q., Ono, H. (eds.) Proceedings of the 10th Asian Logic Conference, pp. 300\u2013321. World Scientific, Singapore (2009)","DOI":"10.1142\/9789814293020_0012"}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-023-00896-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00153-023-00896-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-023-00896-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T06:01:43Z","timestamp":1712642503000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00153-023-00896-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,18]]},"references-count":31,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["896"],"URL":"https:\/\/doi.org\/10.1007\/s00153-023-00896-0","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"type":"print","value":"0933-5846"},{"type":"electronic","value":"1432-0665"}],"subject":[],"published":{"date-parts":[[2023,10,18]]},"assertion":[{"value":"11 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}