Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
On isolating r.e. and isolated d-r.e. degrees
Computability, enumerability, unsolvability
Hi-index | 0.00 |
Lachlan observed that the infimum of two r.e. degrees considered in the r.e. degres coincides with the one considered in the $\Delta_2^0$ degrees. It is not true anymore for the d.r.e. degrees. Kaddah proved in [7] that there are d .r .e . degrees a, b, c and a 3-r .e . degree x such that a is the infimum of b, c in the d.r.e. degrees, but not in the 3-r.e. degrees, as a x b, c. In this paper, we extend Kaddah's result by showing that such a infima difference occurs densely in the r.e. degrees.