Browsing by Subject "Rigid structure"

Sort by: Order: Results:

  • Fokina E.; Frolov A.; Kalimullin I. (2016)
    © 2016 by University of Notre Dame. For a computable structure M, the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of M. If the spectrum has a ...
  • Bazhenov N.; Yamaleev M. (2017)
    © Springer International Publishing AG 2017. We prove that there exists a properly 2-c.e. Turing degree d which cannot be a degree of categoricity of a rigid structure.

Search DSpace

Browse

My Account