Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Cupping Classes of $\Sigma^0_2$ Enumeration Degrees
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Hi-index | 0.00 |
In this paper we prove that every nonzero $\Delta^0_2$e-degree is cuppable to 0e' bya 1-generic $\Delta^0_2$ e-degree (so low and nontotal)and that every nonzero ω-c.e. e-degree is cuppableto 0e' by an incomplete 3-c.e.e-degree.