The -Turing degrees
From MaRDI portal
Publication:2453074
DOI10.1016/J.APAL.2014.04.017zbMATH Open1351.03029OpenAlexW1966930781MaRDI QIDQ2453074FDOQ2453074
Authors: 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
Recommendations
Other Turing degree structures (03D28) Hierarchies of computability and definability (03D55) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Classical recursion theory. Vol. II
- Defining the Turing jump
- Degrees joining to 0′
- On the degrees less than 0'
- Interpretability and Definability in the Recursively Enumerable Degrees
- The Theory of the Degrees below 0 ′
- Definability in the Turing degrees
- The jump operator on the \(\omega \)-enumeration degrees
- The -Enumeration Degrees
- The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees
- On a question of G. E. Sacks
- On a Problem of G. E. Sacks
Cited In (12)
- Title not available (Why is that?)
- Ivan Soskov: a life in computability
- Wadge Degrees ofω-Languages of Deterministic Turing Machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- The typical Turing degree
- ∑1-Density and Turing Degrees
- The -Enumeration Degrees
- Definability in the local structure of the \(\omega\)-Turing degrees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Definability issues in the \(\omega \)-Turing degrees
This page was built for publication: The \(\omega\)-Turing degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453074)
