Turing Definability in the Ershov Hierarchy
From MaRDI portal
Publication:4466450
DOI10.1112/S0024610702003691zbMath1056.03021OpenAlexW2145252685MaRDI QIDQ4466450
Publication date: 10 June 2004
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s0024610702003691
Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)
Related Items
Isolation from side and cone avoidance in the 2-computably enumerable \textit{wtt}-degrees ⋮ Complementing cappable degrees in the difference hierarchy. ⋮ Isolation from side in 2-computably enumerable degrees ⋮ On the problem of definability of the computably enumerable degrees in the difference hierarchy ⋮ Turing computability: structural theory ⋮ Model-theoretic properties of Turing degrees in the Ershov difference hierarchy