Noncappable enumeration degrees below 0e′

DOI10.2307/2275820MaRDI QIDQ3128477zbMATH OpenOpenAlexFDO

Authors S. Barry Cooper, Andrea Sorbi

Publication date 23 April 1997

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

Full work available at URL https://doi.org/10.2307/2275820

zbMATH Keywords

enumeration degreenoncappable degree

Mathematics Subject Classification ID

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

Recommendations

• On the jump classes of noncuppable enumeration degrees
• A high noncuppable \({\Sigma^0_2}\) \(e\)-degree
• Cupping $\Delta_2^0$ Enumeration Degrees to 0 e ′
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets

Cites work

• scientific article; zbMATH DE number 3861137 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
• Enumeration reducibility and partial degrees
• On minimal pairs of enumeration degrees
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Properly Σ2 Enumeration Degrees
• Reducibility and Completeness for Sets of Integers

Cited in

(5)

• The computably enumerable degrees are locally non-cappable
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
• On a conjecture of Lempp
• Strong enumeration reducibilities
• IN MEMORIAM: BARRY COOPER 1943–2015

This page was built for publication: Noncappable enumeration degrees below 0_e^′

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