There are no maximal low d.c.e. degrees
From MaRDI portal
Publication:558429
DOI10.1305/ndjfl/1099080209zbMath1088.03040MaRDI QIDQ558429
Publication date: 6 July 2005
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1099080209
03D28: Other Turing degree structures
Related Items
Isolated maximal d.r.e. degrees, Elementary theories and structural properties of d-c.e. and n-c.e. degrees, A Survey of Results on the d-c.e. and n-c.e. Degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The d.r.e. degrees are not dense
- The recursively enumerable degrees are dense
- Interpolation and embedding in the recursively enumerable degrees
- D.R.E. Degrees and the Nondiamond Theorem
- A recursively enumerable degree which will not split over all lesser ones
- Relative enumerability in the difference hierarchy