Categoricity Spectra of Computable Structures Full article
| Journal |
Journal of Mathematical Sciences (United States)
ISSN: 1072-3374 , E-ISSN: 1573-8795 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2021, Volume: 256, Number: 1, Pages: 34-50 Pages count : 17 DOI: 10.1007/s10958-021-05419-x | ||||
| Tags | 03C57; 03D45; autostability; autostability relative to strong constructivizations; Boolean algebra; categoricity spectrum; computable categoricity; computable structure; decidable categoricity; degree of categoricity; index set; linear order | ||||
| Authors |
|
||||
| Affiliations |
|
Abstract:
The categoricity spectrum of a computable structure S is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable presentations of S. The degree of categoricity of S is the least degree in the categoricity spectrum of S. This paper is a survey of results on categoricity spectra and degrees of categoricity for computable structures. We focus on the results about degrees of categoricity for linear orders and Boolean algebras. We construct a new series of examples of degrees of categoricity for linear orders. © 2021, Springer Science+Business Media, LLC, part of Springer Nature.
Cite:
Bazhenov N.A.
Categoricity Spectra of Computable Structures
Journal of Mathematical Sciences (United States). 2021. V.256. N1. P.34-50. DOI: 10.1007/s10958-021-05419-x Scopus OpenAlex
Categoricity Spectra of Computable Structures
Journal of Mathematical Sciences (United States). 2021. V.256. N1. P.34-50. DOI: 10.1007/s10958-021-05419-x Scopus OpenAlex
Identifiers:
| ≡ Scopus: | 2-s2.0-85106673672 |
| ≡ OpenAlex: | W3166711364 |