Empty intervals in the enumeration degrees

DOI10.1016/J.APAL.2011.06.012zbMATH Open1241.03053OpenAlexW2066016849MaRDI QIDQ764276FDOQ764276

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

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

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)

Cites Work

• Title not available (Why is that?)
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Π₂⁰ enumeration degrees are not dense
• On degrees of recursive unsolvability
• Title not available (Why is that?)
• Title not available (Why is that?)

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)