A structural dichotomy in the enumeration degrees
From MaRDI portal
Recommendations
Cites work
- A jump inversion theorem for the enumeration jump
- Arithmetical Reducibilities I
- Characterizing the continuous degrees
- Classical recursion theory. Vol. II
- Cototal enumeration degrees and their applications to effective mathematics
- Cupping and definability in the local structure of the enumeration degrees
- DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
- Definability via Kalimullin pairs in the structure of the enumeration degrees
- Defining totality in the enumeration degrees
- Degrees of Structures
- Degrees of unsolvability of continuous functions
- Density of the cototal enumeration degrees
- On cototality and the skip operator in the enumeration degrees
- Point Degree Spectra of Represented Spaces
- Randomness for non-computable measures
- Reducibility and Completeness for Sets of Integers
- Semirecursive Sets and Positive Reducibility
- The jump hierarchy in the enumeration degrees
Cited in
(12)- The structure of the s-degrees contained within a single e-degree
- Enumeration degrees and topology
- Enumerative aspects of secondary structures
- Characterizing the continuous degrees
- Nonhemimaximal degrees and the high/low hierarchy
- Badness and jump inversion in the enumeration degrees
- Enumeration of strong dichotomy patterns
- Cototal enumeration degrees and their applications to effective mathematics
- On cototality and the skip operator in the enumeration degrees
- Defining totality in the enumeration degrees
- PA RELATIVE TO AN ENUMERATION ORACLE
- The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees
This page was built for publication: A structural dichotomy in the enumeration degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5082054)