Degrees of categoricity vs. strong degrees of categoricity. (English. Russian original) Zbl 1402.03066

Algebra Logic 55, No. 2, 173-177 (2016); translation from Algebra Logika 55, No. 2, 257-263 (2016).


03D45 Theory of numerations, effectively presented structures
03C57 Computable structure theory, computable model theory
03C35 Categoricity and completeness of theories
03D28 Other Turing degree structures
Full Text: DOI


[1] Fokina, EB; Kalimullin, I; Miller, R, Degrees of categoricity of computable structures, Arch. Math. Log., 49, 51-67, (2010) · Zbl 1184.03026
[2] Csima, BF; Franklin, JN; Shore, RA, Degrees of categoricity and the hyperarithmetic hierarchy, Notre Dame J. Form. Log., 54, 215-231, (2013) · Zbl 1311.03070
[3] Miller, R, d-computable categoricity for algebraic fields, J. Symb. Log., 74, 1325-1351, (2009) · Zbl 1202.03044
[4] B. A. Anderson and B. F. Csima, “Degrees that are not degrees of categoricity,” to appear in Notre Dame J. Form. Log.. · Zbl 1436.03229
[5] N. A. Bazhenov, “Autostability spectra for Boolean algebras,” Algebra and Logic, 53, No. 6, 502-505 (2015). · Zbl 1355.03028
[6] Fokina, E; Frolov, A; Kalimullin, I, Categoricity spectra for rigid structures, Notre Dame J. Form. Log., 57, 45-57, (2016) · Zbl 1359.03030
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.