On the problem of definability of the computably enumerable degrees in the difference hierarchy
From MaRDI portal
Publication:1785041
DOI10.1134/S1995080218050037zbMath1477.03161OpenAlexW2843614064WikidataQ129576846 ScholiaQ129576846MaRDI QIDQ1785041
M. M. Yamaleev, Marat M. Arslanov
Publication date: 27 September 2018
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1995080218050037
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (2)
Isolation from side and cone avoidance in the 2-computably enumerable \textit{wtt}-degrees ⋮ Isolation from side in 2-computably enumerable degrees
Cites Work
- Downward density of exact degrees
- Splitting in 2-computably enumerable degrees with avoiding cones
- Model-theoretic properties of Turing degrees in the Ershov difference hierarchy
- On the r. e. predecessors of d. r. e. degrees
- Splitting and cone avoidance in the d.c.e. degrees
- Jump restricted interpolation in the recursively enumerable degrees
- Nondensity of Double Bubbles in the D.C.E. Degrees
- On Downey's conjecture
- Turing Definability in the Ershov Hierarchy
- Differences of Computably Enumerable Sets
- Definable relations in Turing degree structures
This page was built for publication: On the problem of definability of the computably enumerable degrees in the difference hierarchy
