The minimal complementation property above 0′

DOI10.1002/MALQ.200410044MaRDI QIDQ5693597zbMATH OpenOpenAlexFDO

Authors Andrew E. M. Lewis

Publication date 26 September 2005

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

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

zbMATH Keywords

computabilitycomplementationminimal degrees

Mathematics Subject Classification ID

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

Recommendations

• Minimal complements for degrees below 0′
• A single minimal complement for the c.e. degrees
• Properly ?2 minimal degrees and 0? complementation
• Complementation in the Turing degrees
• Computably enumerable Turing degrees and the meet property

Cites work

• Classical recursion theory. Vol. II
• Finite cupping sets

Cited in

(9)

• Definability issues in the \(\omega \)-Turing degrees
• Minimal complements for degrees below 0′
• scientific article; zbMATH DE number 1258308 (Why is no real title available?)
• An ω-REA set forming a minimal pair with 0 ~ ′
• Extensions of embeddings below computably enumerable degrees
• Joining up to the generalized high degrees
• A single minimal complement for the c.e. degrees
• Properly ?2 minimal degrees and 0? complementation
• Generalized high degrees have the complementation property

This page was built for publication: The minimal complementation property above 0′

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