@inproceedings{e9d7e09c56664f838d7a93bd134fd530,
title = "A note on effective categoricity for linear orderings",
abstract = "We study effective categoricity for linear orderings. For a computable structure S, the degree of categoricity of S is the least Turing degree which is capable of computing isomorphisms among arbitrary computable copies of S. We build new examples of degrees of categoricity for linear orderings. We show that for an infinite computable ordinal α, every Turing degree c.e. in and above 0(2α+2) is the degree of categoricity for some linear ordering. We obtain similar results for linearly ordered abelian groups and decidable linear orderings.",
keywords = "Autostability relative to strong constructivizations, Autostability spectrum, Categoricity spectrum, Computable categoricity, Computable structure, Decidable structure, Degree of categoricity, Linear ordering, Ordered abelian group, STABILITY, COMPUTABLE CATEGORICITY, RECURSIVE STRUCTURES, COMPLEXITY, MODEL-THEORY, SPECTRA",
author = "Nikolay Bazhenov",
year = "2017",
month = jan,
day = "1",
doi = "10.1007/978-3-319-55911-7_7",
language = "English",
isbn = "9783319559100",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "85--96",
editor = "TV Gopal and G Jager and S Steila",
booktitle = "Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Proceedings",
address = "Germany",
note = "14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017 ; Conference date: 20-04-2017 Through 22-04-2017",
}