The \(\omega\)-Turing degrees
From MaRDI portal
Publication:2453074
DOI10.1016/j.apal.2014.04.017zbMath1351.03029OpenAlexW1966930781MaRDI QIDQ2453074
Andrey C. Sariev, Hristo Ganchev
Publication date: 6 June 2014
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2014.04.017
Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28) Hierarchies of computability and definability (03D55)
Related Items
Cites Work
- The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees
- The jump operator on the \(\omega \)-enumeration degrees
- Definability in the Turing degrees
- Classical recursion theory. Vol. II
- Defining the Turing jump
- On the degrees less than 0'
- Degrees joining to 0′
- Interpretability and Definability in the Recursively Enumerable Degrees
- The Theory of the Degrees below 0 ′
- The -Enumeration Degrees
- On a question of G. E. Sacks
- On a Problem of G. E. Sacks