On the jump classes of noncuppable enumeration degrees

DOI10.2178/JSL/1294170994zbMath1215.03056OpenAlexW2036069135MaRDI QIDQ3083133

Charles M. Harris

Publication date: 18 March 2011

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1294170994

zbMATH Keywords

Turing degreesenumeration reducibilitynoncuppable

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (2)

Badness and jump inversion in the enumeration degrees ⋮ Goodness in the enumeration and singleton degrees

Cites Work

• Unnamed Item
• A high noncuppable \({\Sigma^0_2}\) \(e\)-degree
• Goodness in the enumeration and singleton degrees
• The \(n\)-rea enumeration degrees are dense
• Limit lemmas and jump inversion in the enumeration degrees
• On minimal pairs of enumeration degrees
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets

This page was built for publication: On the jump classes of noncuppable enumeration degrees