Standard
A note on effective categoricity for linear orderings. / Bazhenov, Nikolay.
Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Proceedings. ed. / TV Gopal; G Jager; S Steila. Springer-Verlag GmbH and Co. KG, 2017. p. 85-96 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10185 LNCS).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Harvard
Bazhenov, N 2017,
A note on effective categoricity for linear orderings. in TV Gopal, G Jager & S Steila (eds),
Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10185 LNCS, Springer-Verlag GmbH and Co. KG, pp. 85-96, 14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017, Bern, Switzerland,
20.04.2017.
https://doi.org/10.1007/978-3-319-55911-7_7
APA
Vancouver
Bazhenov N.
A note on effective categoricity for linear orderings. In Gopal TV, Jager G, Steila S, editors, Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Proceedings. Springer-Verlag GmbH and Co. KG. 2017. p. 85-96. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-55911-7_7
Author
Bazhenov, Nikolay. /
A note on effective categoricity for linear orderings. Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Proceedings. editor / TV Gopal ; G Jager ; S Steila. Springer-Verlag GmbH and Co. KG, 2017. pp. 85-96 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
BibTeX
@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",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017 ; Conference date: 20-04-2017 Through 22-04-2017",
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",
}
RIS
TY - GEN
T1 - A note on effective categoricity for linear orderings
AU - Bazhenov, Nikolay
N1 - Publisher Copyright:
© Springer International Publishing AG 2017.
PY - 2017/1/1
Y1 - 2017/1/1
N2 - 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.
AB - 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.
KW - Autostability relative to strong constructivizations
KW - Autostability spectrum
KW - Categoricity spectrum
KW - Computable categoricity
KW - Computable structure
KW - Decidable structure
KW - Degree of categoricity
KW - Linear ordering
KW - Ordered abelian group
KW - STABILITY
KW - COMPUTABLE CATEGORICITY
KW - RECURSIVE STRUCTURES
KW - COMPLEXITY
KW - MODEL-THEORY
KW - SPECTRA
UR - http://www.scopus.com/inward/record.url?scp=85018440589&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-55911-7_7
DO - 10.1007/978-3-319-55911-7_7
M3 - Conference contribution
AN - SCOPUS:85018440589
SN - 9783319559100
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 85
EP - 96
BT - Theory and Applications of Models of Computation - 14th Annual Conference, TAMC 2017, Proceedings
A2 - Gopal, TV
A2 - Jager, G
A2 - Steila, S
PB - Springer-Verlag GmbH and Co. KG
T2 - 14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017
Y2 - 20 April 2017 through 22 April 2017
ER -
