The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees

DOI10.1016/j.apal.2010.10.004zbMath1243.03058OpenAlexW2053061147MaRDI QIDQ764275

Hristo Ganchev, Mariya Ivanova Soskova

Publication date: 13 March 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2010.10.004

zbMATH Keywords

definabilityenumeration degreestrue arithmeticlocal theory\(\omega \)-enumeration degrees

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items

Unnamed Item ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ The \(\omega\)-Turing degrees ⋮ The automorphism group and definability of the jump operator in the \(\omega\)-enumeration degrees ⋮ Definability in the local structure of the ω-Turing degrees ⋮ Definability via Kalimullin pairs in the structure of the enumeration degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The jump operator on the \(\omega \)-enumeration degrees
• Classical recursion theory. Vol. II
• Note on Degrees of Partial Functions
• How enumeration reductibility yields extended Harrington non-splitting
• Cupping Δ₂⁰ enumeration degrees to 0_e′
• Jumps of quasi-minimal enumeration degrees
• Interpretability and Definability in the Recursively Enumerable Degrees
• DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
• Exact Pair Theorem for the ω-Enumeration Degrees
• The  -Enumeration Degrees
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets