{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T08:26:12Z","timestamp":1775463972488,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319559100","type":"print"},{"value":"9783319559117","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-55911-7_7","type":"book-chapter","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T10:23:37Z","timestamp":1490005417000},"page":"85-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Note on Effective Categoricity for Linear Orderings"],"prefix":"10.1007","author":[{"given":"Nikolay","family":"Bazhenov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,21]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Anderson, B.A., Csima, B.F.: Degrees that are not degrees of categoricity. Notre Dame J. Formal Logic. Advance Publication. doi: \n10.1215\/00294527-3496154","DOI":"10.1215\/00294527-3496154"},{"issue":"3","key":"7_CR2","doi-asserted-by":"crossref","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(3), 195\u2013205 (1989)","journal-title":"Ann. Pure Appl. Logic"},{"key":"7_CR3","doi-asserted-by":"crossref","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. Am. Math. Soc. 298, 497\u2013514 (1986)","journal-title":"Trans. Am. Math. Soc."},{"key":"7_CR4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0168-0072(86)90048-5","volume":"32","author":"CJ Ash","year":"1986","unstructured":"Ash, C.J.: Stability of recursive structures in arithmetical degrees. Ann. Pure Appl. Logic 32, 113\u2013135 (1986)","journal-title":"Ann. Pure Appl. Logic"},{"key":"7_CR5","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Computable Structures and the Hyperarithmetical Hierarchy","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 Science B.V, Amsterdam (2000)"},{"issue":"3","key":"7_CR6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0168-0072(90)90004-L","volume":"46","author":"CJ Ash","year":"1990","unstructured":"Ash, C.J., Knight, J.F.: Pairs of recursive structures. Ann. Pure Appl. Logic 46(3), 211\u2013234 (1990)","journal-title":"Ann. Pure Appl. Logic"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Bazhenov, N.: Autostability spectra for decidable structures. Math. Struct. Comput. Sci. (accepted)","DOI":"10.1017\/S096012951600030X"},{"issue":"6","key":"7_CR8","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/s10469-015-9311-3","volume":"53","author":"NA Bazhenov","year":"2015","unstructured":"Bazhenov, N.A.: Autostability spectra for Boolean algebras. Algebra Logic 53(6), 502\u2013505 (2015)","journal-title":"Algebra Logic"},{"key":"7_CR9","unstructured":"Bazhenov, N.A.: Degrees of autostability for linear orderings and linearly ordered abelian groups. Algebra Logic (accepted)"},{"issue":"3","key":"7_CR10","doi-asserted-by":"crossref","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. Symbolic Logic 55(3), 1168\u20131191 (1990)","journal-title":"J. Symbolic Logic"},{"issue":"3","key":"7_CR11","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.2178\/jsl\/1245158098","volume":"74","author":"J Chisholm","year":"2009","unstructured":"Chisholm, J., Fokina, E.B., Goncharov, S.S., Harizanov, V.S., Knight, J.F., Quinn, S.: Intrinsic bounds on complexity and definability at limit levels. J. Symbolic Logic 74(3), 1047\u20131060 (2009)","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"7_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1215\/00294527-1960479","volume":"54","author":"BF Csima","year":"2013","unstructured":"Csima, B.F., Franklin, J.N.Y., Shore, R.A.: Degrees of categoricity and the hyperarithmetic hierarchy. Notre Dame J. Formal Logic 54(2), 215\u2013231 (2013)","journal-title":"Notre Dame J. Formal Logic"},{"key":"7_CR13","unstructured":"Downey, R.G.: Computability theory and linear orderings. In: Ershov, Y., Goncharov, S.S., Nerode, A., Remmel, J.B. (eds.) Handbook of Recursive Mathematics, vol. 2, pp. 823\u2013976. Elsevier Science B.V., Amsterdam (1998). Stud. Logic Found. Math., vol. 139"},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.aim.2014.09.022","volume":"268","author":"RG Downey","year":"2015","unstructured":"Downey, R.G., Kach, A.M., Lempp, S., Lewis-Pye, A.E.M., Montalb\u00e1n, A., Turetsky, D.D.: The complexity of computable categoricity. Adv. Math. 268, 423\u2013466 (2015)","journal-title":"Adv. Math."},{"key":"7_CR15","doi-asserted-by":"crossref","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)"},{"issue":"1","key":"7_CR16","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1215\/00294527-3322017","volume":"57","author":"E Fokina","year":"2016","unstructured":"Fokina, E., Frolov, A., Kalimullin, I.: Categoricity spectra for rigid structures. Notre Dame J. Formal Logic 57(1), 45\u201357 (2016)","journal-title":"Notre Dame J. Formal Logic"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Fokina, E.B., Harizanov, V., Melnikov, A.: Computable model theory. In: Downey, R. (ed.) Turing\u2019s Legacy: Developments from Turing Ideas in Logic. Lecture Notes in Logic, vol. 42, pp. 124\u2013194. Cambridge University Press, Cambridge (2014)","DOI":"10.1017\/CBO9781107338579.006"},{"issue":"1","key":"7_CR18","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s00153-009-0160-4","volume":"49","author":"EB Fokina","year":"2010","unstructured":"Fokina, E.B., Kalimullin, I., Miller, R.: Degrees of categoricity of computable structures. Arch. Math. Logic 49(1), 51\u201367 (2010)","journal-title":"Arch. Math. Logic"},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1098\/rsta.1956.0003","volume":"248","author":"A Fr\u00f6hlich","year":"1956","unstructured":"Fr\u00f6hlich, A., Shepherdson, J.C.: Effective procedures in field theory. Philos. Trans. Roy. Soc. London Ser. A 248, 407\u2013432 (1956)","journal-title":"Philos. Trans. Roy. Soc. London Ser. A"},{"issue":"5","key":"7_CR20","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/s10469-015-9362-5","volume":"54","author":"AN Frolov","year":"2015","unstructured":"Frolov, A.N.: Effective categoricity of computable linear orderings. Algebra Logic 54(5), 415\u2013417 (2015)","journal-title":"Algebra Logic"},{"issue":"3","key":"7_CR21","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.apal.2005.02.001","volume":"136","author":"S Goncharov","year":"2005","unstructured":"Goncharov, S., Harizanov, V., Knight, J., McCoy, C., Miller, R., Solomon, R.: Enumerations in computable structure theory. Ann. Pure Appl. Logic 136(3), 219\u2013246 (2005)","journal-title":"Ann. Pure Appl. Logic"},{"key":"7_CR22","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1134\/S0081543811060071","volume":"274","author":"SS Goncharov","year":"2011","unstructured":"Goncharov, S.S.: Degrees of autostability relative to strong constructivizations. Proc. Steklov Inst. Math. 274, 105\u2013115 (2011)","journal-title":"Proc. Steklov Inst. Math."},{"issue":"3","key":"7_CR23","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01669456","volume":"16","author":"SS Goncharov","year":"1977","unstructured":"Goncharov, S.S.: The quantity of nonautoequivalent constructivizations. Algebra Logic 16(3), 169\u2013185 (1977)","journal-title":"Algebra Logic"},{"issue":"1","key":"7_CR24","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BF01669102","volume":"19","author":"SS Goncharov","year":"1980","unstructured":"Goncharov, S.S., Dzgoev, V.D.: Autostability of models. Algebra Logic 19(1), 28\u201337 (1980)","journal-title":"Algebra Logic"},{"key":"7_CR25","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1070\/RM1961v016n03ABEH001120","volume":"16","author":"AI Mal\u2019tsev","year":"1961","unstructured":"Mal\u2019tsev, A.I.: Constructive algebras I. Russ. Math. Surv. 16, 77\u2013129 (1961)","journal-title":"Russ. Math. Surv."},{"key":"7_CR26","first-page":"1431","volume":"32","author":"AI Mal\u2019tsev","year":"1962","unstructured":"Mal\u2019tsev, A.I.: On recursive abelian groups. Sov. Math. Dokl. 32, 1431\u20131434 (1962)","journal-title":"Sov. Math. Dokl."},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-13962-8_36","volume-title":"Programs, Proofs, Processes","author":"AG Melnikov","year":"2010","unstructured":"Melnikov, A.G.: Computable ordered abelian groups and fields. In: Ferreira, F., L\u00f6we, B., Mayordomo, E., Mendes Gomes, L. (eds.) CiE 2010. LNCS, vol. 6158, pp. 321\u2013330. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-13962-8_36"},{"issue":"4","key":"7_CR28","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.2178\/jsl\/1254748694","volume":"74","author":"R Miller","year":"2009","unstructured":"Miller, R.: \n            $$\\mathbf{d}$$\n          -computable categoricity for algebraic fields. J. Symb. Log. 74(4), 1325\u20131351 (2009)","journal-title":"J. Symb. Log."},{"key":"7_CR29","doi-asserted-by":"crossref","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":"7_CR30","volume-title":"Linear Orderings","author":"JG Rosenstein","year":"1982","unstructured":"Rosenstein, J.G.: Linear Orderings, vol. 98. Academic Press, New York (1982). Pure Appl. Math"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55911-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T03:58:36Z","timestamp":1511323116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55911-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319559100","9783319559117"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55911-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}