Abstract
We prove that there exists a properly 2-c.e. Turing degree \(\mathbf{d}\) which cannot be a degree of categoricity of a rigid structure.
N.A.Bazhenov—Supported by RFBR project No. 16-31-60058 mol_a_dk.
M.M.Yamaleev—Supported by RFBR projects No. 15-01-08252, 16-31-50048, and by the subsidy allocated to Kazan Federal University for the state assignment in the sphere of scientific activity (No. 1.1515.2017/PCh). The work is performed according to the Russian Government Program of Competitive Growth of Kazan Federal University and by the research grant of Kazan Federal University.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Fröhlich, A., Shepherdson, J.C.: Effective procedures in field theory. Phil. Trans. R. Soc. Lond. A 248(950), 407–432 (1956)
Mal’tsev, A.I.: Constructive algebras. I. Russ. Math. Surv. 16(3), 77–129 (1961)
Mal’tsev, A.I.: On recursive abelian groups. Sov. Math. Dokl. 32, 1431–1434 (1962)
Fokina, E.B., Kalimullin, I., Miller, R.: Degrees of categoricity of computable structures. Arch. Math. Logic 49(1), 51–67 (2010)
Csima, B.F., Franklin, J.N.Y., Shore, R.A.: Degrees of categoricity and the hyperarithmetic hierarchy. Notre Dame J. Form. Logic 54(2), 215–231 (2013)
Anderson, B.A., Csima, B.F.: Degrees that are not degrees of categoricity. Notre Dame J. Form. Logic 57(3), 389–398 (2016)
Miller, R.: \(\mathbf{d}\)-computable categoricity for algebraic fields. J. Symb. Log. 74(4), 1325–1351 (2009)
Miller, R., Shlapentokh, A.: Computable categoricity for algebraic fields with splitting algorithms. Trans. Amer. Math. Soc. 367(6), 3955–3980 (2015)
Bazhenov, N.A.: Degrees of categoricity for superatomic Boolean algebras. Algebra Logic 52(3), 179–187 (2013)
Bazhenov, N.A.: \(\Delta ^0_2\)-categoricity of Boolean algebras. J. Math. Sci. 203(4), 444–454 (2014)
Bazhenov, N.A.: Autostability spectra for Boolean algebras. Algebra Logic 53(6), 502–505 (2015)
Bazhenov, N.A.: Degrees of autostability relative to strong constructivizations for Boolean algebras. Algebra Logic 55(2), 87–102 (2016)
Frolov, A.N.: Effective categoricity of computable linear orderings. Algebra Logic 54(5), 415–417 (2015)
Bazhenov, N.A.: Degrees of autostability for linear orders and linearly ordered abelian groups. Algebra Logic 55(4), 257–273 (2016)
Fokina, E., Frolov, A., Kalimullin, I.: Categoricity spectra for rigid structures. Notre Dame J. Form. Logic. 57(1), 45–57 (2016)
Goncharov, S.S.: Degrees of autostability relative to strong constructivizations. Proc. Steklov Inst. Math. 274, 105–115 (2011)
Bazhenov, N.A.: Autostability spectra for decidable structures. Math. Struct. Comput. Sci. (to appear). doi:10.1017/S096012951600030X.
Bazhenov, N.A., Kalimullin, I., Yamaleev, M.M.: Degrees of categoricity vs. strong degrees of categoricity. Algebra Logic 55(2), 173–177 (2016)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Bazhenov, N.A., Yamaleev, M.M. (2017). Degrees of Categoricity of Rigid Structures. In: Kari, J., Manea, F., Petre, I. (eds) Unveiling Dynamics and Complexity. CiE 2017. Lecture Notes in Computer Science(), vol 10307. Springer, Cham. https://doi.org/10.1007/978-3-319-58741-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-58741-7_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-58740-0
Online ISBN: 978-3-319-58741-7
eBook Packages: Computer ScienceComputer Science (R0)