Kazan Federal University Digital Repository

Browsing by Subject "computably enumerable sets"

Browsing by Subject "computably enumerable sets"

Sort by: Order: Results:

  • Isolated 2-computably enumerable Q-degrees 
    Batyrshin I. (2010)
    In this work we prove that for every pair of computably enumerable degrees a<Q b there exists a properly 2-computably enumerable degree d such that a <Q d <Q b, a isolates d from below, and b isolates d from above. Two ...
  • Strong Degrees of Categoricity and Weak Density 
    Bazhenov N.A.; Kalimullin I.S.; Yamaleev M.M. (2020)
    © 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 ...
  • Strong noncuppability in low computably enumerable degrees 
    Yamaleev M. (2010)
    We prove the existence of noncomputable low computably enumerable degrees b < a such that b is strongly noncuppable to a in the class R. © 2010 Allerton Press, Inc.

Search DSpace

Browse

My Account