A single minimal complement for the c.e. degrees

DOI10.1090/S0002-9947-07-04331-0zbMath1128.03032OpenAlexW2075799000MaRDI QIDQ3592759

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)

Related Items

Finite cupping sets ⋮ Properly ?2 minimal degrees and 0? complementation

Cites Work

• Unnamed Item
• Unnamed Item
• On degrees of recursive unsolvability
• Finite cupping sets
• Complementation in the Turing degrees
• Generic Sets and Minimal α-Degrees
• Degrees joining to 0′
• Minimal degrees and the jump operator
• Minimal degrees of unsolvability and the full approximation construction
• Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
• Minimal complements for degrees below 0′