Definability in the Local Theory of the ω-Enumeration Degrees

DOI10.1007/978-3-642-03073-4_25zbMath1233.03048OpenAlexW1530010332MaRDI QIDQ3576056

Hristo Ganchev

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_25

Mathematics Subject Classification ID

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

Related Items

Enumeration Reducibility and Computable Structure Theory

Cites Work

• The jump operator on the \(\omega \)-enumeration degrees
• Uniform regular enumerations
• 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