There are no maximal low d.c.e. degrees
From MaRDI portal
Publication:558429
DOI10.1305/NDJFL/1099080209zbMATH Open1088.03040OpenAlexW1980334422MaRDI QIDQ558429FDOQ558429
Authors: Liang Yu, Rodney G. Downey 
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
Recommendations
- scientific article; zbMATH DE number 1523417
- There Are No Maximal d.c.e. wtt-degrees
- Degrees which do not bound minimal degrees
- There exists a maximal 3-c.e. enumeration degree
- Degrees that Are Low for Isomorphism
- Degrees bounding minimal degrees
- Low upper bounds in the LR degrees
- The \(\text{low}_n\) and \(\text{low}_m\) r.e. degrees are not elementarily equivalent
- The degree of nonminimality is at most 2
- Minimal degrees which are Σ₂⁰ but not Δ₂⁰
Cites Work
- The recursively enumerable degrees are dense
- Title not available (Why is that?)
- Relative enumerability in the difference hierarchy
- The d.r.e. degrees are not dense
- D.R.E. Degrees and the Nondiamond Theorem
- Interpolation and embedding in the recursively enumerable degrees
- Title not available (Why is that?)
- A recursively enumerable degree which will not split over all lesser ones
- Title not available (Why is that?)
Cited In (10)
- Non-uniformity and generalised Sacks splitting
- On a problem of Ishmukhametov
- \(\mathcal{D}\)-maximal sets
- A survey of results on the d.c.e. and \(n\)-c.e. degrees
- Title not available (Why is that?)
- Elementary theories and structural properties of d-c.e. and n-c.e. degrees
- Nonisolated degrees and the jump operator
- A survey of results on the d-c.e. and n-c.e. degrees
- There exists a maximal 3-c.e. enumeration degree
- Isolated maximal d.r.e. degrees
This page was built for publication: There are no maximal low d.c.e. degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q558429)
