Empty intervals in the enumeration degrees

DOI10.1016/J.APAL.2011.06.012MaRDI QIDQ764276zbMATH OpenOpenAlexFDO

Authors Thomas F. Kent, Andrew E. M. Lewis, Andrea Sorbi

Publication date 13 March 2012

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apal.2011.06.012

zbMATH Keywords

empty intervalenumeration degreeenumeration reducibilitypositive reducibilitystrong minimal cover

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• scientific article; zbMATH DE number 221461
• Quasi-minimal enumeration degrees and minimal Turing degrees
• Strong Minimal Covers for Recursively Enumerable Degrees
• A 1-generic degree with a strong minimal cover
• On minimal pairs of enumeration degrees

Cites work

• scientific article; zbMATH DE number 4160710 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3532932 (Why is no real title available?)
• scientific article; zbMATH DE number 3532933 (Why is no real title available?)
• scientific article; zbMATH DE number 1955470 (Why is no real title available?)
• On degrees of recursive unsolvability
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• The Π₂⁰ enumeration degrees are not dense

Cited in

(2)

• Fragments of the theory of the enumeration degrees
• Enumeration Reducibility Using Bounded Information: Counting Minimal Covers

This page was built for publication: Empty intervals in the enumeration degrees

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