Isolated d.r.e. degrees are dense in r.e. degree structure
From MaRDI portal
Publication:1354326
DOI10.1007/S001530050053zbMath0874.03053OpenAlexW2071009856MaRDI QIDQ1354326
Publication date: 5 November 1997
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001530050053
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (8)
Bi-isolation in the d.c.e. degrees ⋮ The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees ⋮ Isolation from side and cone avoidance in the 2-computably enumerable \textit{wtt}-degrees ⋮ Complementing cappable degrees in the difference hierarchy. ⋮ Isolation from side in 2-computably enumerable degrees ⋮ Infima of d.r.e. Degrees ⋮ Nonisolated degrees and the jump operator ⋮ Isolation and lattice embeddings
This page was built for publication: Isolated d.r.e. degrees are dense in r.e. degree structure