The Isolated D. R. E. Degrees are Dense in the R. E. Degrees

DOI10.1002/malq.19960420108zbMath0854.03043OpenAlexW2044124909MaRDI QIDQ4868243

Geoffrey L. LaForte

Publication date: 13 January 1997

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19960420108

zbMATH Keywords

densitydifference hierarchyrecursively enumerable degreesisolated degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (13)

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 ⋮ \textit{CEA} operators and the ershov hierarchy ⋮ Infima of d.r.e. Degrees ⋮ Isolation in the CEA hierarchy ⋮ 2001 Annual Meeting of the Association for Symbolic Logic ⋮ 1998–99 Annual Meeting of the Association for Symbolic Logic ⋮ Nonisolated degrees and the jump operator ⋮ An Interval of Computably Enumerable Isolating Degrees ⋮ Isolation and lattice embeddings

This page was built for publication: The Isolated D. R. E. Degrees are Dense in the R. E. Degrees