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

DOI10.1002/MALQ.19960420108zbMATH Open0854.03043OpenAlexW2044124909MaRDI QIDQ4868243FDOQ4868243

Authors: 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

Recommendations

• Isolated d.r.e. degrees are dense in r.e. degree structure
• Isolated d-r.e. degree below r.e. degree
• Nonisolated degrees and the jump operator
• Isolated from above \(d\)-r. e. degrees. I

zbMATH Keywords

densitydifference hierarchyrecursively enumerable degreesisolated degrees

Mathematics Subject Classification ID

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

Cited In (18)

• Downward density of exact degrees
• The density of the meet-inaccessible r. e. degrees
• Isolation from side and cone avoidance in the 2-computably enumerable \textit{wtt}-degrees
• Isolation from side in 2-computably enumerable degrees
• \textit{CEA} operators and the ershov hierarchy
• Isolation and the jump operator
• Complementing cappable degrees in the difference hierarchy.
• The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees
• Bi-isolation in the d.c.e. degrees
• 2001 Annual Meeting of the Association for Symbolic Logic. University of Pennsylvania, Philadelphia, PA, March 10-13, 2001
• Nonisolated degrees and the jump operator
• Isolation in the d.c.e. degrees
• Isolation in the CEA hierarchy
• The d.r.e \(wtt\)-degrees are dense
• Infima of d.r.e. degrees
• An Interval of Computably Enumerable Isolating Degrees
• 1998–99 Annual Meeting of the Association for Symbolic Logic
• Isolation and lattice embeddings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4868243)