{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:19:17Z","timestamp":1772119157623,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T00:00:00Z","timestamp":1723766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T00:00:00Z","timestamp":1723766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Mathematical Center in Akademgorodok","award":["075-15-2019-1613"],"award-info":[{"award-number":["075-15-2019-1613"]}]},{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"crossref","award":["18-11-00028"],"award-info":[{"award-number":["18-11-00028"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Volga Region Mathematical Center","award":["075-02-2020-1478"],"award-info":[{"award-number":["075-02-2020-1478"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Arch. Math. Logic"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00153-024-00934-5","type":"journal-article","created":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T12:02:16Z","timestamp":1723809736000},"page":"279-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On categoricity of scattered linear orders of constructive ranks"],"prefix":"10.1007","volume":"64","author":[{"given":"Andrey","family":"Frolov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Zubkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"934_CR1","unstructured":"Maltsev, A.I.: On recursive abelian groups. Sov. Math. Dokl. 3, 1431\u20131434 (1962)"},{"key":"934_CR2","doi-asserted-by":"publisher","first-page":"151","DOI":"10.2307\/2266902","volume":"20","author":"C Spector","year":"1955","unstructured":"Spector, C.: Recursive well-orderings. J. Symb. Logic 20, 151\u2013163 (1955)","journal-title":"J. Symb. Logic"},{"key":"934_CR3","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01669456","volume":"16","author":"SS Goncharov","year":"1977","unstructured":"Goncharov, S.S.: The quantity of nonautoequivalent constructivizations. Algebra Logic 16, 257\u2013282 (1977)","journal-title":"Algebra Logic"},{"key":"934_CR4","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/BF01668470","volume":"14","author":"SS Goncharov","year":"1975","unstructured":"Goncharov, S.S.: Autostability and computable families of constructivizations. Algebra Logic 14, 647\u2013680 (1975)","journal-title":"Algebra Logic"},{"key":"934_CR5","first-page":"45","volume":"19","author":"SS Goncharov","year":"1980","unstructured":"Goncharov, S.S., Dzgoev, V.D.: Autostability of models. Algebra Logic 19, 45\u201358 (1980)","journal-title":"Algebra Logic"},{"key":"934_CR6","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1090\/S0002-9939-1981-0624937-1","volume":"83","author":"JB Remmel","year":"1981","unstructured":"Remmel, J.B.: Recursively categorical linear orderings. Proc. Am. Math. Soc. 83, 387\u2013391 (1981)","journal-title":"Proc. Am. Math. Soc."},{"key":"934_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0168-0072(02)00035-0","volume":"119","author":"CFD McCoy","year":"2003","unstructured":"McCoy, C.F.D.: $$\\Delta ^0_2$$-categoricity in Boolean algebras and linear orderings. Ann. Pure Appl. Logic 119, 85\u2013120 (2003)","journal-title":"Ann. Pure Appl. Logic"},{"key":"934_CR8","doi-asserted-by":"crossref","unstructured":"Gonzalez, D., Rosseger, D.: The scott sentence complexity of linear orders. arXiv:2305.07126 (2023)","DOI":"10.1017\/jsl.2024.59"},{"key":"934_CR9","first-page":"143","volume":"39","author":"AM Kach","year":"2009","unstructured":"Kach, A.M., Turetsky, D.: $$\\Delta ^0_2$$-categoricity of equivalence structures. N. Z. J. Math 39, 143\u2013149 (2009)","journal-title":"N. Z. J. Math"},{"key":"934_CR10","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/s10469-015-9362-5","volume":"54","author":"AN Frolov","year":"2015","unstructured":"Frolov, A.N.: Effective categoricity of computable linear orders. Algebra Logic 54, 638\u2013642 (2015)","journal-title":"Algebra Logic"},{"key":"934_CR11","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1023\/A:1020927703492","volume":"41","author":"CFD McCoy","year":"2002","unstructured":"McCoy, C.F.D.: Partial results in $$\\Delta ^0_3$$-categoricity in linear orderings and Boolean algebras. Algebra Logika 41, 531\u2013552 (2002)","journal-title":"Algebra Logika"},{"key":"934_CR12","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1090\/S0002-9947-1986-0860377-7","volume":"298","author":"CJ Ash","year":"1986","unstructured":"Ash, C.J.: Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees. Trans. AMS 298, 497\u2013514 (1986)","journal-title":"Trans. AMS"},{"key":"934_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10469-016-9381-x","volume":"55","author":"NA Bazhenov","year":"2016","unstructured":"Bazhenov, N.A.: Degrees of autostability relative to strong constructivizations for Boolean algebras. Algebra Logic 55, 133\u2013155 (2016)","journal-title":"Algebra Logic"},{"key":"934_CR14","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1023\/A:1025971406116","volume":"42","author":"R Downey","year":"2003","unstructured":"Downey, R., Hiershfeldt, D., Khoussainov, B.: Uniformity in computable structure theory. Algebra Logic 42, 566\u2013593 (2003)","journal-title":"Algebra Logic"},{"key":"934_CR15","doi-asserted-by":"crossref","unstructured":"Miller, R.: Revisiting uniform computable categoricity: for the sixtieth birthday of prof. rod downey. In: Computability and Complexity. Lecture Notes in Computer Science vol. 10010. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-50062-1_18"},{"key":"934_CR16","doi-asserted-by":"publisher","first-page":"5427","DOI":"10.1090\/proc\/12669","volume":"143","author":"A Montalban","year":"2015","unstructured":"Montalban, A.: A robuster scott rank. Proc. Am. Math. Soc. 143, 5427\u20135436 (2015)","journal-title":"Proc. Am. Math. Soc."},{"key":"934_CR17","unstructured":"Scott, D.: Logic with denumerably long formulas and finite strings of quantifiers. In: The Theory of Models, pp. 329\u2013341. North-Holland, Amsterdam (1965)"},{"key":"934_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0168-0072(89)90015-8","volume":"42","author":"C Ash","year":"1989","unstructured":"Ash, C., Knight, J., Manasse, M., Slaman, T.: Generic copies of countable structures. Ann. Pure Appl. Logic 42, 195\u2013205 (1989)","journal-title":"Ann. Pure Appl. Logic"},{"key":"934_CR19","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.2307\/2274481","volume":"55","author":"J Chisholm","year":"1990","unstructured":"Chisholm, J.: Effective model theory vs recursive model theory. J. Symb. Logic 55, 1168\u20131191 (1990)","journal-title":"J. Symb. Logic"},{"key":"934_CR20","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1017\/jsl.2020.46","volume":"85","author":"R Alvir","year":"2020","unstructured":"Alvir, R., Rossegger, D.: The complexity of scott sentences of scattered linear orders. J. Symb. Logic 85, 1079\u20131101 (2020)","journal-title":"J. Symb. Logic"},{"key":"934_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2021.103060","volume":"173","author":"N Bazhenov","year":"2022","unstructured":"Bazhenov, N., Rossegger, D., Zubkov, M.: On bi-embeddable categoricity of algebraic structures. Ann. Pure Appl. Logic 173, 103060 (2022)","journal-title":"Ann. Pure Appl. Logic"},{"key":"934_CR22","volume-title":"Turing Computability, Theory and Applications","author":"RI Soare","year":"2016","unstructured":"Soare, R.I.: Turing Computability, Theory and Applications. Springer, Berlin (2016)"},{"key":"934_CR23","volume-title":"Linear Orderings","author":"JG Rosenstei","year":"1982","unstructured":"Rosenstei, J.G.: Linear Orderings. Academic Press Inc., New York-London (1982)"},{"key":"934_CR24","doi-asserted-by":"crossref","unstructured":"Downey, R.G.: Computability theory and linear orderings. In: Handbook of Recursive Mathematics V. 2, pp. 823\u2013976. Elsevier, Amsterdam (1998)","DOI":"10.1016\/S0049-237X(98)80047-5"},{"key":"934_CR25","doi-asserted-by":"publisher","first-page":"563","DOI":"10.2307\/2274189","volume":"49","author":"R Watnick","year":"1984","unstructured":"Watnick, R.: A generalization of tennenbaum\u2019s theorem on effectively finite recursive linear orderings. J. Symb. Logic 49, 563\u2013569 (1984)","journal-title":"J. Symb. Logic"},{"key":"934_CR26","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1090\/S0002-9947-1990-0955487-0","volume":"319","author":"C Ash","year":"1990","unstructured":"Ash, C., Jockusch, K., Knight, J.: Jumps of orderings. Trans. AMS 319, 573\u2013599 (1990)","journal-title":"Trans. AMS"},{"key":"934_CR27","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10469-009-9067-8","volume":"48","author":"PE Alaev","year":"2009","unstructured":"Alaev, P.E., Frolov, A.N., Thurber, J.: Computability on linear orderings enriched with predicates. Algebra Logic 48, 313\u2013320 (2009)","journal-title":"Algebra Logic"},{"key":"934_CR28","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1007\/s11202-010-0091-7","volume":"51","author":"AN Frolov","year":"2010","unstructured":"Frolov, A.N.: Linear orders of low degree. Sib. Math. J. 51, 913\u2013925 (2010)","journal-title":"Sib. Math. J."}],"container-title":["Archive for Mathematical Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-024-00934-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00153-024-00934-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00153-024-00934-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T00:40:44Z","timestamp":1739320844000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00153-024-00934-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,16]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["934"],"URL":"https:\/\/doi.org\/10.1007\/s00153-024-00934-5","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-2585682\/v1","asserted-by":"object"}]},"ISSN":["0933-5846","1432-0665"],"issn-type":[{"value":"0933-5846","type":"print"},{"value":"1432-0665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,16]]},"assertion":[{"value":"14 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}