The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees
From MaRDI portal
Publication:3502682
DOI10.1007/978-3-540-79228-4_51zbMath1140.03023OpenAlexW1491422241MaRDI QIDQ3502682
Matthew C. Salts, S. Barry Cooper, Guohua Wu
Publication date: 27 May 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_51
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Isolated d.r.e. degrees are dense in r.e. degree structure
- Isolation and the high/low hierarchy
- Interpolating \(d\)-r.e. and REA degrees between r.e. degrees
- The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees
- D.R.E. Degrees and the Nondiamond Theorem
- An Interval of Computably Enumerable Isolating Degrees
- Isolation and lattice embeddings
- The Isolated D. R. E. Degrees are Dense in the R. E. Degrees
- Post's Programme for the Ershov Hierarchy
This page was built for publication: The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees
