Abstract
It is shown that for any computably enumerable degree a ‰ 0, and any Turing degree s, if s ≥ 0 ′, and c.e. in a, then there exists a c.e. degree x with the following properties: x < a, a is splittable over x, and x ′ = s.
| Original language | English |
|---|---|
| Pages (from-to) | 133-142 |
| Number of pages | 10 |
| Journal | Computability |
| Volume | 7 |
| Issue number | 2-3 |
| DOIs | |
| State | Published - 2018 |
| Externally published | Yes |
Keywords
- Turing degrees
- computably enumerable degree
- jump inversion
- splitting
Fingerprint
Dive into the research topics of 'Splitting and jump inversion in the Turing degrees'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver