Finite cupping sets

DOI10.1007/S00153-004-0215-5MaRDI QIDQ1762727zbMATH OpenOpenAlexFDO

Authors Xianqiang Yang

Publication date 11 February 2005

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00153-004-0215-5

zbMATH Keywords

Turing degree structures

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Recommendations

• A minimal pair joining to a plus cupping Turing degree
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
• On a hierarchy of plus-cupping degrees
• Theory and Applications of Models of Computation
• Measure and cupping in the Turing degrees

Cites work

• A single minimal complement for the c.e. degrees
• Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
• Degrees joining to 0′
• Minimal complements for degrees below 0′

Cited in

(5)

• Measure and cupping in the Turing degrees
• The minimal complementation property above 0′
• The limitations of cupping in the local structure of the enumeration degrees
• A single minimal complement for the c.e. degrees
• Properly ?2 minimal degrees and 0? complementation

This page was built for publication: Finite cupping sets

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