Every Set has a Least Jump Enumeration

DOI10.1112/S0024610700001459zbMath1023.03036OpenAlexW2118322961MaRDI QIDQ3150949

Theodore A. Slaman, Richard J. Coles, 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

Turing degreecomputably enumerable setleast jump

Mathematics Subject Classification ID

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

Related Items (12)

The jump operation for structure degrees ⋮ New degree spectra of Polish spaces ⋮ Turing degrees of nonabelian groups ⋮ Bi‐embeddability spectra and bases of spectra ⋮ Classifications of computable structures ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Jump degrees of torsion-free abelian groups ⋮ Spectra of Algebraic Fields and Subfields ⋮ Defining totality in the enumeration degrees ⋮ COMPUTABLE ABELIAN GROUPS ⋮ Enumerations and completely decomposable torsion-free abelian groups ⋮ Decomposability and computability

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