Every Set has a Least Jump Enumeration

DOI10.1112/S0024610700001459MaRDI QIDQ3150949zbMATH OpenOpenAlexFDO

Authors Richard Coles, Theodore A. Slaman, Rodney G. Downey

Publication date 22 October 2002

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/s0024610700001459

zbMATH Keywords

computably enumerable setleast jumpTuring degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Recommendations

• Regular enumerations
• Enumerations and completely decomposable torsion-free abelian groups
• On relative enumerability of Turing degrees
• Enumerations, countable structures and Turing degrees
• Limit lemmas and jump inversion in the enumeration degrees

Cited in

(13)

• Classifications of computable structures
• Decomposability and computability
• Computable abelian groups
• Enumeration reducibility and computable structure theory
• Spectra of Algebraic Fields and Subfields
• Jump degrees of torsion-free abelian groups
• Bi‐embeddability spectra and bases of spectra
• Turing degrees of nonabelian groups
• Defining totality in the enumeration degrees
• Ivan Soskov: a life in computability
• Enumerations and completely decomposable torsion-free abelian groups
• The jump operation for structure degrees
• New degree spectra of Polish spaces

This page was built for publication: Every Set has a Least Jump Enumeration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3150949)