{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T06:06:50Z","timestamp":1774591610437,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2018,9,26]],"date-time":"2018-09-26T00:00:00Z","timestamp":1537920000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["No. 16-31-60058 mol a dk"],"award-info":[{"award-number":["No. 16-31-60058 mol a dk"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"crossref","award":["the subsidy allocated to Kazan Federal University for the state assignment in the sphere of scientic activities, project No. 1.1515.2017\/4.6."],"award-info":[{"award-number":["the subsidy allocated to Kazan Federal University for the state assignment in the sphere of scientic activities, project No. 1.1515.2017\/4.6."]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Nazarbayev University Faculty Development Competitive Research Grants","award":["N090118FD5342."],"award-info":[{"award-number":["N090118FD5342."]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s00153-018-0647-y","type":"journal-article","created":{"date-parts":[[2018,9,26]],"date-time":"2018-09-26T01:43:52Z","timestamp":1537926232000},"page":"485-500","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Elementary theories and hereditary undecidability for semilattices of numberings"],"prefix":"10.1007","volume":"58","author":[{"given":"Nikolay","family":"Bazhenov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2967-9008","authenticated-orcid":false,"given":"Manat","family":"Mustafa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mars","family":"Yamaleev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,26]]},"reference":[{"key":"647_CR1","volume-title":"Theory of Numberings","author":"YL Ershov","year":"1977","unstructured":"Ershov, Y.L.: Theory of Numberings. Nauka, Moscow (1977). (in Russian)"},{"key":"647_CR2","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0049-237X(99)80030-5","volume-title":"Handbook of Computability Theory. Studies in Logic and the Foundations of Mathematics","author":"YL Ershov","year":"1999","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. 140, pp. 473\u2013503. North-Holland, Amsterdam (1999)"},{"issue":"6","key":"647_CR3","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)","journal-title":"Algebra Log."},{"key":"647_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1090\/conm\/257\/04025","volume-title":"Computability Theory and Its Applications. Contemporary Mathematics","author":"SA Badaev","year":"2000","unstructured":"Badaev, S.A., Goncharov, S.S.: Theory of numberings: open problems. In: Cholak, P., Lempp, S., Lerman, M., Shore, R. (eds.) Computability Theory and Its Applications. Contemporary Mathematics, vol. 257, pp. 23\u201338. American Mathematical Society, Providence (2000)"},{"key":"647_CR5","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)"},{"key":"647_CR6","unstructured":"Herbert, I., Jain, S., Lempp, S., Mustafa, M., Stephan, F.: Reductions between types of numberings (submitted)"},{"issue":"5","key":"647_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BF02218586","volume":"12","author":"VV V\u2019jugin","year":"1973","unstructured":"V\u2019jugin, V.V.: On some examples of upper semilattices of computable enumerations. Algebra Log. 12(5), 277\u2013286 (1973)","journal-title":"Algebra Log."},{"issue":"3","key":"647_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10469-005-0016-x","volume":"44","author":"SA Badaev","year":"2005","unstructured":"Badaev, S.A., Goncharov, S.S., Sorbi, A.: Elementary theories for Rogers semilattices. Algebra Log. 44(3), 143\u2013147 (2005)","journal-title":"Algebra Log."},{"key":"647_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/malq.19550010205","volume":"1","author":"J Myhill","year":"1955","unstructured":"Myhill, J.: Creative sets. Z. Math. Log. Grundl. Math. 1, 97\u2013108 (1955)","journal-title":"Z. Math. Log. Grundl. Math."},{"issue":"5","key":"647_CR10","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)","journal-title":"Algebra Log."},{"key":"647_CR11","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: Cooper, S.B., Goncharov, S.S. (eds.) Computability and Models, pp. 11\u201344. Springer, New York (2003)"},{"key":"647_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-1-4615-0755-0_3","volume-title":"Computability and Models","author":"S Badaev","year":"2003","unstructured":"Badaev, S., Goncharov, S., Podzorov, S., Sorbi, A.: Algebraic properties of Rogers semilattices of arithmetical numberings. In: Cooper, S.B., Goncharov, S.S. (eds.) Computability and Models, pp. 45\u201378. Springer, New York (2003)"},{"key":"647_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-1-4615-0755-0_4","volume-title":"Computability and Models","author":"S Badaev","year":"2003","unstructured":"Badaev, S., Goncharov, S., Sorbi, A.: Isomorphism types and theories of Rogers semilattices of arithmetical numberings. In: Cooper, S.B., Goncharov, S.S. (eds.) Computability and Models, pp. 79\u201392. Springer, New York (2003)"},{"issue":"1","key":"647_CR14","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1023\/A:1010521410739","volume":"67","author":"S Gao","year":"2001","unstructured":"Gao, S., Gerdes, P.: Computably enumerable equivalence relations. Stud. Log. 67(1), 27\u201359 (2001)","journal-title":"Stud. Log."},{"issue":"1","key":"647_CR15","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1017\/jsl.2013.8","volume":"79","author":"U Andrews","year":"2014","unstructured":"Andrews, U., Lempp, S., Miller, J.S., Ng, K.M., San Mauro, L., Sorbi, A.: Universal computably enumerable equivalence relations. J. Symb. Log. 79(1), 60\u201388 (2014)","journal-title":"J. Symb. Log."},{"key":"647_CR16","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-319-50062-1_25","volume-title":"Computability and Complexity. Lecture Notes in Computer Science","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. Lecture Notes in Computer Science, vol. 10010, pp. 418\u2013451. Springer, Cham (2017)"},{"key":"647_CR17","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H Rogers Jr","year":"1967","unstructured":"Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)"},{"issue":"5","key":"647_CR18","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF00739571","volume":"33","author":"A Nies","year":"1994","unstructured":"Nies, A.: The last question on recursively enumerable \n                    \n                      \n                    \n                    $$m$$\n                    \n                      \n                        m\n                      \n                    \n                  -degrees. Algebra Log. 33(5), 307\u2013314 (1994)","journal-title":"Algebra Log."},{"issue":"2","key":"647_CR19","doi-asserted-by":"publisher","first-page":"319","DOI":"10.2140\/pjm.1986.122.319","volume":"122","author":"JS Carroll","year":"1986","unstructured":"Carroll, J.S.: Some undecidability results for lattices in recursion theory. Pac. J. Math. 122(2), 319\u2013331 (1986)","journal-title":"Pac. J. Math."},{"issue":"4","key":"647_CR20","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1002\/malq.19940400407","volume":"40","author":"A Nies","year":"1994","unstructured":"Nies, A.: Recursively enumerable equivalence relations modulo finite differences. Math. Log. Q. 40(4), 490\u2013518 (1994)","journal-title":"Math. Log. Q."},{"key":"647_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0049-237X(08)71260-6","volume-title":"The Kleene Symposium","author":"A Nerode","year":"1980","unstructured":"Nerode, A., Shore, R.A.: Second order logic and first order theories of reducibility orderings. In: Barwise, J., Keisler, H.J., Kunen, K. (eds.) The Kleene Symposium, pp. 181\u2013200. North-Holland, Amsterdam (1980)"},{"key":"647_CR22","volume-title":"Problems of Decidability and Constructive Models","author":"YL Ershov","year":"1980","unstructured":"Ershov, Y.L.: Problems of Decidability and Constructive Models. Nauka, Moscow (1980). (in Russian)"},{"issue":"1","key":"647_CR23","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/BF01190967","volume":"35","author":"A Nies","year":"1996","unstructured":"Nies, A.: Undecidable fragments of elementary theories. Algebra Universalis 35(1), 8\u201333 (1996)","journal-title":"Algebra Universalis"},{"issue":"5","key":"647_CR24","doi-asserted-by":"publisher","first-page":"1729","DOI":"10.1093\/logcom\/exu066","volume":"26","author":"SO Speranski","year":"2016","unstructured":"Speranski, S.O.: A note on hereditarily \n                    \n                      \n                    \n                    $$\\varPi ^0_1$$\n                    \n                      \n                        \n                          \u03a0\n                          1\n                          0\n                        \n                      \n                    \n                  - and \n                    \n                      \n                    \n                    $$\\varSigma ^0_1$$\n                    \n                      \n                        \n                          \u03a3\n                          1\n                          0\n                        \n                      \n                    \n                  -complete sets of sentences. J. Log. Comput. 26(5), 1729\u20131741 (2016)","journal-title":"J. Log. Comput."},{"issue":"4","key":"647_CR25","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1070\/RM1965v020n04ABEH001188","volume":"20","author":"YL Ershov","year":"1965","unstructured":"Ershov, Y.L., Lavrov, I.A., Taimanov, A.D., Taitslin, M.A.: Elementary theories. Russ. Math. Surv. 20(4), 35\u2013105 (1965)","journal-title":"Russ. Math. Surv."},{"key":"647_CR26","volume-title":"Computable Structures and the Hyperarithmetical Hierarchy. Studies in Logic and the Foundations of Mathematics","author":"CJ Ash","year":"2000","unstructured":"Ash, C.J., Knight, J.F.: Computable Structures and the Hyperarithmetical Hierarchy. Studies in Logic and the Foundations of Mathematics, vol. 144. Elsevier, Amsterdam (2000)"},{"issue":"1","key":"647_CR27","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/BF02219847","volume":"9","author":"YL Ershov","year":"1970","unstructured":"Ershov, Y.L.: On a hierarchy of sets. III. Algebra Log. 9(1), 20\u201331 (1970)","journal-title":"Algebra Log."}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-018-0647-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00153-018-0647-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-018-0647-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T19:03:14Z","timestamp":1569438194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00153-018-0647-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,26]]},"references-count":27,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["647"],"URL":"https:\/\/doi.org\/10.1007\/s00153-018-0647-y","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,26]]},"assertion":[{"value":"26 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}