{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T09:04:26Z","timestamp":1750323866565,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003182","name":"Siberian Branch, Russian Academy of Sciences","doi-asserted-by":"publisher","award":["FWNF-2022-0011"],"award-info":[{"award-number":["FWNF-2022-0011"]}],"id":[{"id":"10.13039\/501100003182","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["18-11-00028"],"award-info":[{"award-number":["18-11-00028"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012190","name":"Ministry of Science and Higher Education of the Russian Federation","doi-asserted-by":"crossref","award":["075-02-2020-1478"],"award-info":[{"award-number":["075-02-2020-1478"]}],"id":[{"id":"10.13039\/501100012190","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s00153-022-00842-6","type":"journal-article","created":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T16:02:53Z","timestamp":1658332973000},"page":"239-256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of $$\\Sigma ^0_n$$-classifications for definable subsets"],"prefix":"10.1007","volume":"62","author":[{"given":"Svetlana","family":"Aleksandrova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5834-2770","authenticated-orcid":false,"given":"Nikolay","family":"Bazhenov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Zubkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,20]]},"reference":[{"issue":"4","key":"842_CR1","first-page":"23","volume":"8","author":"SS Goncharov","year":"2008","unstructured":"Goncharov, S.S., Kogabaev, N.T.: On $$\\Sigma ^0_1$$-classification of relations on computable structures. Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform. 8(4), 23\u201332 (2008). (In Russian)","journal-title":"Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform."},{"issue":"6","key":"842_CR2","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 Logic 36(6), 359\u2013369 (1997). https:\/\/doi.org\/10.1007\/BF02671553","journal-title":"Algebra Logic"},{"key":"842_CR3","unstructured":"Ershov, Y.L.: Theory of Numberings. Nauka, Moscow (1977). (In Russian)"},{"key":"842_CR4","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0049-237X(99)80030-5","volume-title":"Handbook of Computability Theory. Stud. Logic Found. Math.","author":"YL Ershov","year":"1999","unstructured":"Ershov, Y.L.: Theory of numberings. In: Griffor, E.R. (ed.) Handbook of Computability Theory. Stud. Logic Found. Math., vol. 140, pp. 473\u2013503. North-Holland, Amsterdam (1999). https:\/\/doi.org\/10.1016\/S0049-237X(99)80030-5"},{"key":"842_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1090\/conm\/257\/04025","volume-title":"Computability Theory and Its Applications. Contemp. Math.","author":"SA Badaev","year":"2000","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. Contemp. Math., vol. 257, pp. 23\u201338. American Mathematical Society, Providence (2000). https:\/\/doi.org\/10.1090\/conm\/257\/04025"},{"issue":"3","key":"842_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.2307\/2964290","volume":"23","author":"RM Friedberg","year":"1958","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","journal-title":"J. Symb. Log."},{"key":"842_CR7","volume-title":"Hilbert\u2019s Tenth Problem","author":"YV Matiyasevich","year":"1993","unstructured":"Matiyasevich, Y.V.: Hilbert\u2019s Tenth Problem. MIT Press, Cambridge (1993)"},{"issue":"5","key":"842_CR8","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10469-019-09559-7","volume":"58","author":"S Boyadzhiyska","year":"2019","unstructured":"Boyadzhiyska, S., Lange, K., Raz, A., Scanlon, R., Wallbaum, J., Zhang, X.: Classifications of definable subsets. Algebra Logic 58(5), 383\u2013404 (2019). https:\/\/doi.org\/10.1007\/s10469-019-09559-7","journal-title":"Algebra Logic"},{"key":"842_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4305-3","volume-title":"Constructive Models","author":"YL Ershov","year":"2000","unstructured":"Ershov, Y.L., Goncharov, S.S.: Constructive Models. Kluwer Academic\/Plenum Publishers, New York (2000)"},{"key":"842_CR10","volume-title":"Computable Structures and the Hyperarithmetical Hierarchy. Stud. Logic Found. Math.","author":"CJ Ash","year":"2000","unstructured":"Ash, C.J., Knight, J.F.: Computable Structures and the Hyperarithmetical Hierarchy. Stud. Logic Found. Math., vol. 144. Elsevier, Amsterdam (2000)"},{"key":"842_CR11","volume-title":"Linear Orderings. Pure Appl. Math.","author":"JG Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear Orderings. Pure Appl. Math., vol. 98. Academic Press, New York (1982)"},{"issue":"2","key":"842_CR12","doi-asserted-by":"publisher","first-page":"673","DOI":"10.2307\/2274709","volume":"56","author":"CJ Ash","year":"1991","unstructured":"Ash, C.J.: A construction for recursive linear orderings. J. Symb. Log. 56(2), 673\u2013683 (1991). https:\/\/doi.org\/10.2307\/2274709","journal-title":"J. Symb. Log."},{"issue":"2","key":"842_CR13","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1090\/S0002-9939-1992-1065942-0","volume":"114","author":"R Downey","year":"1992","unstructured":"Downey, R., Knight, J.F.: Orderings with $$\\alpha $$-th jump degrees $$0^{(\\alpha )}$$. Proc. Amer. Math. Soc. 114(2), 545\u2013552 (1992). https:\/\/doi.org\/10.1090\/S0002-9939-1992-1065942-0","journal-title":"Proc. Amer. Math. Soc."},{"issue":"7","key":"842_CR14","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1016\/j.apal.2018.03.001","volume":"169","author":"F Mwesigye","year":"2018","unstructured":"Mwesigye, F., Truss, J.K.: Ehrenfeucht-Fra\u00efss\u00e9 games on ordinals. Ann. Pure Appl. Logic 169(7), 616\u2013636 (2018). https:\/\/doi.org\/10.1016\/j.apal.2018.03.001","journal-title":"Ann. Pure Appl. Logic"},{"key":"842_CR15","first-page":"572","volume-title":"Logical Methods. Progress in Computer Science and Applied Logic","author":"M Moses","year":"1993","unstructured":"Moses, M.: $$n$$-Recursive linear orders without $$(n+1)$$-recursive copies. In: Crossley, J.N., Remmel, J.B., Shore, R.A., Sweedler, M.E. (eds.) Logical Methods. Progress in Computer Science and Applied Logic, vol. 12, pp. 572\u2013592. Birkhauser, Boston, MA (1993)"},{"issue":"2","key":"842_CR16","doi-asserted-by":"publisher","first-page":"1850010","DOI":"10.1142\/S0219061318500101","volume":"18","author":"M Harrison-Trainor","year":"2018","unstructured":"Harrison-Trainor, M.: There is no classification of the decidably presentable structures. J. Math. Log. 18(2), 1850010 (2018). https:\/\/doi.org\/10.1142\/S0219061318500101","journal-title":"J. Math. Log."}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-022-00842-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00153-022-00842-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-022-00842-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T13:05:01Z","timestamp":1674047101000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00153-022-00842-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["842"],"URL":"https:\/\/doi.org\/10.1007\/s00153-022-00842-6","relation":{},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"type":"print","value":"0933-5846"},{"type":"electronic","value":"1432-0665"}],"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"8 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2022","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 have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}