A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES
From MaRDI portal
Publication:5082054
DOI10.1017/jsl.2019.72zbMath1506.03097OpenAlexW3042106073MaRDI QIDQ5082054
Hristo Ganchev, Joseph S. Miller, Mariya Ivanova Soskova, Iskander Sh. Kalimullin
Publication date: 15 June 2022
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/jsl.2019.72
Other degrees and reducibilities in computability and recursion theory (03D30) Computation over the reals, computable analysis (03D78)
Related Items
Cites Work
- Classical recursion theory. Vol. II
- A jump inversion theorem for the enumeration jump
- Density of the cototal enumeration degrees
- Characterizing the continuous degrees
- Randomness for non-computable measures
- Reducibility and Completeness for Sets of Integers
- DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
- Cototal enumeration degrees and their applications to effective mathematics
- The jump hierarchy in the enumeration degrees
- Degrees of Structures
- On cototality and the skip operator in the enumeration degrees
- Definability via Kalimullin pairs in the structure of the enumeration degrees
- Degrees of unsolvability of continuous functions
- Cupping and definability in the local structure of the enumeration degrees
- Semirecursive Sets and Positive Reducibility
- Arithmetical Reducibilities I
- Defining totality in the enumeration degrees
- Point Degree Spectra of Represented Spaces
This page was built for publication: A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES
