A hierarchy for cuppable degrees

zbMATH Open0967.03038MaRDI QIDQ1584492FDOQ1584492

Authors: Guohua Wu, Zaiyue Zhang, Angsheng Li 

Publication date: 3 September 2001

Published in: Illinois Journal of Mathematics (Search for Journal in Brave)

Recommendations

• scientific article
• On a hierarchy of plus-cupping degrees
• A hierarchy for the plus cupping Turing degrees
• A Matter of Degree
• scientific article
• Beyond degree choosability
• Joining to high degrees via noncuppables
• Abstract hierarchies and degrees
• Bounding cappable degrees
• Degrees of streams

zbMATH Keywords

computably enumerable degrees\(\text{low}_n\)-cuppable degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Cited In (13)

• On a hierarchy of plus-cupping degrees
• Title not available (Why is that?)
• Prompt simplicity, array computability and cupping
• Joining to high degrees via noncuppables
• Cupping computably enumerable degrees simultaneously
• A Minimal Pair in the Quotient Structure M/NCup
• The method of the Yu–Ding Theorem and its application
• Cuppability of simple and hypersimple sets
• A hierarchy for the plus cupping Turing degrees
• CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES
• Title not available (Why is that?)
• Cupping and definability in the local structure of the enumeration degrees
• Strong noncuppability in low computably enumerable degrees

This page was built for publication: A hierarchy for cuppable degrees

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