A minimal pair joining to a plus cupping Turing degree

DOI10.1002/MALQ.200310060zbMATH Open1046.03024OpenAlexW1974126287MaRDI QIDQ4452449FDOQ4452449

Dengfeng Li, Angsheng Li

Publication date: 12 February 2004

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200310060

Recommendations

• On a hierarchy of plus-cupping degrees
• A hierarchy for the plus cupping Turing degrees
• Joining to high degrees via noncuppables
• Highness, locally noncappability and nonboundings
• Plus cupping degrees do not form an ideal

zbMATH Keywords

minimal pairplus cupping degreecomputably enumerable Turing degreesnonbounding degree

Mathematics Subject Classification ID

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

Cited In (2)

• Finite cupping sets
• On the definable ideal generated by the plus cupping c.e. degrees

This page was built for publication: A minimal pair joining to a plus cupping Turing degree

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