Exact Pair Theorem for the ω-Enumeration Degrees

DOI10.1007/978-3-540-73001-9_33zbMath1151.03335OpenAlexW1521843611MaRDI QIDQ5425333

Hristo Ganchev

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73001-9_33

zbMATH Keywords

jumpenumeration degreesexact pair\(\omega \)-enumeration degrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (5)

Unnamed Item ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ The automorphism group and definability of the jump operator in the \(\omega\)-enumeration degrees ⋮ Definability in the Local Theory of the ω-Enumeration Degrees ⋮ The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees

This page was built for publication: Exact Pair Theorem for the ω-Enumeration Degrees