Strong Minimal Covers for Recursively Enumerable Degrees

DOI10.1002/MALQ.19960420116MaRDI QIDQ4879197zbMATH OpenOpenAlexFDO

Authors S. Barry Cooper

Publication date 4 November 1996

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

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

zbMATH Keywords

recursively enumerable degreestrong minimal coverTuring degree

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 221461
• Empty intervals in the enumeration degrees
• A 1-generic degree with a strong minimal cover
• A single minimal complement for the c.e. degrees

Cites work

• A 1-generic degree with a strong minimal cover

Cited in

(8)

• The minimum degree of recursively representable choice functions
• Strong minimal covers and a question of Yates: the story so far
• Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets
• Effective calculations of the degree of ∗-covering
• scientific article; zbMATH DE number 221461 (Why is no real title available?)
• Π10 classes, strong minimal covers and hyperimmune-free degrees
• Empty intervals in the enumeration degrees
• Intervals containing exactly one c.e. degree

This page was built for publication: Strong Minimal Covers for Recursively Enumerable Degrees

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