摘要
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.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 133-142 |
| 页数 | 10 |
| 期刊 | Computability |
| 卷 | 7 |
| 期 | 2-3 |
| DOI | |
| 出版状态 | 已出版 - 2018 |
| 已对外发布 | 是 |
指纹
探究 'Splitting and jump inversion in the Turing degrees' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver