4 found
Order:
  1.  25
    Degrees of categoricity and spectral dimension.Nikolay A. Bazhenov, Iskander Sh Kalimullin & Mars M. Yamaleev - 2018 - Journal of Symbolic Logic 83 (1):103-116.
    A Turing degreedis the degree of categoricity of a computable structure${\cal S}$ifdis the least degree capable of computing isomorphisms among arbitrary computable copies of${\cal S}$. A degreedis the strong degree of categoricity of${\cal S}$ifdis the degree of categoricity of${\cal S}$, and there are computable copies${\cal A}$and${\cal B}$of${\cal S}$such that every isomorphism from${\cal A}$onto${\cal B}$computesd. In this paper, we build a c.e. degreedand a computable rigid structure${\cal M}$such thatdis the degree of categoricity of${\cal M}$, butdis not the strong degree of categoricity (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  2.  12
    Turing reducibility in the fine hierarchy.Alexander G. Melnikov, Victor L. Selivanov & Mars M. Yamaleev - 2020 - Annals of Pure and Applied Logic 171 (7):102766.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3.  12
    Low ce and low 2-ce degrees are not elementarily equivalent.Mars M. Yamaleev - unknown
    Direct download  
     
    Export citation  
     
    Bookmark  
  4. On Cupping and Ahmad Pairs.Iskander Sh Kalimullin, Steffen Lempp, N. G. Keng Meng & Mars M. Yamaleev - forthcoming - Journal of Symbolic Logic:1-11.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark