The automorphism group and definability of the jump operator in the -enumeration degrees
From MaRDI portal
(Redirected from Publication:2238145)
The automorphism group and definability of the jump operator in the \(\omega\)-enumeration degrees
The automorphism group and definability of the jump operator in the \(\omega\)-enumeration degrees
Recommendations
Cites work
- Bounding nonsplitting enumeration degrees
- DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
- Definability via Kalimullin pairs in the structure of the enumeration degrees
- Defining the Turing jump
- Defining totality in the enumeration degrees
- Exact Pair Theorem for the ω-Enumeration Degrees
- scientific article; zbMATH DE number 4160710 (Why is no real title available?)
- scientific article; zbMATH DE number 7360060 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Initial segments of the \({\Sigma}_2^0\) enumeration degrees
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
- Semirecursive Sets and Positive Reducibility
- The automorphism group of the enumeration degrees
- The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees
- The jump operator on the \(\omega \)-enumeration degrees
- The -Enumeration Degrees
- Uniform regular enumerations
Cited in
(3)
This page was built for publication: The automorphism group and definability of the jump operator in the \(\omega\)-enumeration degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238145)