The automorphism group and definability of the jump operator in the \(\omega\)-enumeration degrees

DOI10.1007/S00153-021-00766-7OpenAlexW3146484709MaRDI QIDQ2238145

Andrey C. Sariev, Hristo Ganchev

Publication date: 29 October 2021

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-021-00766-7

zbMATH Keywords

definabilityjumpenumeration reducibilitydegree structures

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Other Turing degree structures (03D28)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees
• The jump operator on the \(\omega \)-enumeration degrees
• Defining the Turing jump
• The automorphism group of the enumeration degrees
• INITIAL SEGMENTS OF THE ENUMERATION DEGREES
• Uniform regular enumerations
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
• Definability via Kalimullin pairs in the structure of the enumeration degrees
• Exact Pair Theorem for the ω-Enumeration Degrees
• The  -Enumeration Degrees
• Bounding nonsplitting enumeration degrees
• Semirecursive Sets and Positive Reducibility
• Defining totality in the enumeration degrees

This page was built for publication: The automorphism group and definability of the jump operator in the \(\omega\)-enumeration degrees