Computability theory
We study the structural interactions between the c.e. and the d.c.e. degrees. It is well-known that there are intervals d.c.e. degrees containing no c.e. degrees, and that if an interval of d.c.e. degrees contains two or more c.e. degrees, then this interval contains infinitely many c.e. degrees. A natural question is whether there are intervals of d.c.e. degrees containing exactly one c.e. degree (strictly between). We will call such c.e. degrees bi-isolating degrees. We know that these degrees are densely distributed in the high c.e. degrees, and we will prove that the bi-isolating degrees can also be low.
Mail to Webmaster alc9@math.nsc.ru |
|Home Page| |English Part| |
Go to Home |