© 2020, Pleiades Publishing, Ltd. Abstract: It is well-known that every c.e. Turing degree is the degree of categoricity of a rigid structure. In this work we study the possibility of extension of this result to properly 2-c.e. degrees. We found a condition such that if a Δ02-degree is a degree of categoricity of a rigid structure and satisfies this condition then it must be c.e. Also we show that degrees of non-categoricity are dense in the c.e. degrees
In [Countable thin II1 classes, Ann. Pure Appl. Logic 59 (1993) 79-139], Cenzer, Downey, Jockusch an...
In [Countable thin II1 classes, Ann. Pure Appl. Logic 59 (1993) 79-139], Cenzer, Downey, Jockusch an...
© 2018 The Association for Symbolic Logic. A Turing degree d is the degree of categoricity of a comp...
© Springer International Publishing AG 2017. We prove that there exists a properly 2-c.e. Turing deg...
© Springer International Publishing AG 2017. We prove that there exists a properly 2-c.e. Turing deg...
© Springer International Publishing AG 2017. We prove that there exists a properly 2-c.e. Turing deg...
© Springer International Publishing AG 2017. We prove that there exists a properly 2-c.e. Turing deg...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...
© 2016 by University of Notre Dame. For a computable structure M, the categoricity spectrum is the s...
© 2016 by University of Notre Dame. For a computable structure M, the categoricity spectrum is the s...
© 2016 by University of Notre Dame. For a computable structure M, the categoricity spectrum is the s...
© 2016 by University of Notre Dame. For a computable structure M, the categoricity spectrum is the s...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...
In [Countable thin II1 classes, Ann. Pure Appl. Logic 59 (1993) 79-139], Cenzer, Downey, Jockusch an...
In [Countable thin II1 classes, Ann. Pure Appl. Logic 59 (1993) 79-139], Cenzer, Downey, Jockusch an...
© 2018 The Association for Symbolic Logic. A Turing degree d is the degree of categoricity of a comp...
© Springer International Publishing AG 2017. We prove that there exists a properly 2-c.e. Turing deg...
© Springer International Publishing AG 2017. We prove that there exists a properly 2-c.e. Turing deg...
© Springer International Publishing AG 2017. We prove that there exists a properly 2-c.e. Turing deg...
© Springer International Publishing AG 2017. We prove that there exists a properly 2-c.e. Turing deg...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...
© 2016 by University of Notre Dame. For a computable structure M, the categoricity spectrum is the s...
© 2016 by University of Notre Dame. For a computable structure M, the categoricity spectrum is the s...
© 2016 by University of Notre Dame. For a computable structure M, the categoricity spectrum is the s...
© 2016 by University of Notre Dame. For a computable structure M, the categoricity spectrum is the s...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M...
In [Countable thin II1 classes, Ann. Pure Appl. Logic 59 (1993) 79-139], Cenzer, Downey, Jockusch an...
In [Countable thin II1 classes, Ann. Pure Appl. Logic 59 (1993) 79-139], Cenzer, Downey, Jockusch an...
© 2018 The Association for Symbolic Logic. A Turing degree d is the degree of categoricity of a comp...