A single minimal complement for the c.e. degrees

DOI10.1090/S0002-9947-07-04331-0MaRDI QIDQ3592759zbMATH OpenOpenAlexFDO

Authors Andrew E. M. Lewis

Publication date 24 September 2007

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/s0002-9947-07-04331-0

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Recommendations

• Minimal complements for degrees below 0′
• Properly ?2 minimal degrees and 0? complementation
• Complementation in the Turing degrees
• The minimal complementation property above 0′
• Computably enumerable Turing degrees and the meet property

Cites work

• Complementation in the Turing degrees
• Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
• Degrees joining to 0′
• Finite cupping sets
• Generic Sets and Minimal α-Degrees
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3274733 (Why is no real title available?)
• Minimal complements for degrees below 0′
• Minimal degrees and the jump operator
• Minimal degrees of unsolvability and the full approximation construction
• On degrees of recursive unsolvability

Cited in

(10)

• Finite cupping sets
• Complementation in the Turing degrees
• Minimal complementation below uniform upper bounds for the arithmetical degrees
• A fixed-point-free minimal degree
• Properly ?2 minimal degrees and 0? complementation
• scientific article; zbMATH DE number 749930 (Why is no real title available?)
• Strong Minimal Covers for Recursively Enumerable Degrees
• Minimal complements for degrees below 0′
• On the existence of a strong minimal pair
• The minimal complementation property above 0′

This page was built for publication: A single minimal complement for the c.e. degrees

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