Аннотация
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.
Язык оригинала | английский |
---|---|
Страницы (с-по) | 34-50 |
Число страниц | 17 |
Журнал | Journal of Mathematical Sciences (United States) |
Том | 256 |
Номер выпуска | 1 |
DOI | |
Состояние | Опубликовано - июл 2021 |
Предметные области OECD FOS+WOS
- 1.01 МАТЕМАТИКА