An Interval of Computably Enumerable Isolating Degrees
From MaRDI portal
A computably enumerable (c.e.) degree \({\mathbf a}\) is said to isolate a d.c.e. degree \({\mathbf d}\) in c.e. degrees, if there is no c.e. degree \({\mathbf b}\) such that \({\mathbf a}<{\mathbf b}<{\mathbf d}\). In this paper the following theorem is proved: Theorem. There exist c.e. degrees \({\mathbf a}< {\mathbf b}\) such that every c.e. degree \({\mathbf c}\), \({\mathbf a}< {\mathbf c}< {\mathbf b}\), isolates some d.c.e. degree.
Recommendations
Cited in
(15)- A short proof of the degree bound for interval number
- Isolation and the high/low hierarchy
- Undecidability and 1-types in intervals of the computably enumerable degrees
- Isolation in the CEA hierarchy
- Nonisolated degrees and the jump operator
- Isolated 2-computably enumerable \(Q\)-degrees
- Isolation from side in 2-computably enumerable degrees
- The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees
- Non-isolated quasi-degrees
- scientific article; zbMATH DE number 2063233 (Why is no real title available?)
- Isolation and lattice embeddings
- Bi-isolation in the d.c.e. degrees
- Isolation from side and cone avoidance in the 2-computably enumerable \textit{wtt}-degrees
- Splitting in 2-computably enumerable degrees with avoiding cones
- Intervals containing exactly one c.e. degree
This page was built for publication: An Interval of Computably Enumerable Isolating Degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4238426)
