A jump inversion theorem for the enumeration jump

DOI10.1007/S001530050156zbMath0960.03037OpenAlexW2022920911MaRDI QIDQ1584013

Ivan N. Soskov

Publication date: 30 October 2000

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

Full work available at URL: https://doi.org/10.1007/s001530050156

zbMATH Keywords

enumeration reducibilityenumeration jumpjump inversion theoremminimal pair type theorem

Mathematics Subject Classification ID

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

Related Items (9)

The jump operation for structure degrees ⋮ The automorphism group of the enumeration degrees ⋮ A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Defining totality in the enumeration degrees ⋮ COMPUTABLE ABELIAN GROUPS ⋮ Regular enumerations ⋮ The jump operator on the \(\omega \)-enumeration degrees ⋮ Definability via Kalimullin pairs in the structure of the enumeration degrees

This page was built for publication: A jump inversion theorem for the enumeration jump