Recommendations
Cites work
- Classical recursion theory. Vol. II
- Definability in the Turing degrees
- Defining the Turing jump
- Degrees joining to 0′
- Interpretability and Definability in the Recursively Enumerable Degrees
- On a Problem of G. E. Sacks
- On a question of G. E. Sacks
- On the degrees less than 0'
- The Theory of the Degrees below 0 ′
- The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees
- The jump operator on the \(\omega \)-enumeration degrees
- The -Enumeration Degrees
Cited in
(12)- Definability issues in the \(\omega \)-Turing degrees
- scientific article; zbMATH DE number 761273 (Why is no real title available?)
- Ivan Soskov: a life in computability
- Wadge Degrees ofω-Languages of Deterministic Turing Machines
- scientific article; zbMATH DE number 1390015 (Why is no real title available?)
- scientific article; zbMATH DE number 1962805 (Why is no real title available?)
- The typical Turing degree
- ∑1-Density and Turing Degrees
- The -Enumeration Degrees
- Definability in the local structure of the \(\omega\)-Turing degrees
- scientific article; zbMATH DE number 3861135 (Why is no real title available?)
- scientific article; zbMATH DE number 5504384 (Why is no real title available?)
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)