On the existence of a strong minimal pair

DOI10.1142/S0219061315500038MaRDI QIDQ5501923zbMATH OpenOpenAlexFDO

Authors George Barmpalias, Mingzhong Cai, Steffen Lempp, Theodore A. Slaman

Publication date 14 August 2015

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

Full work available at URL https://arxiv.org/abs/1610.03591

zbMATH Keywords

computably enumerable degreesextension of embeddingsminimal pairTuring degrees

Mathematics Subject Classification ID

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

Abstract: We show that there is a strong minimal pair in the computably enumerable Turing degrees.

Recommendations

• Constructing minimal pairs of degrees
• Minimal pairs in initial segments of the recursively enumerable degrees
• A minimal pair in the generic degrees
• On minimal pairs of enumeration degrees
• A single minimal complement for the c.e. degrees

Cites work

• A minimal pair of recursively enumerable degrees
• A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees
• A recursively enumerable degree which will not split over all lesser ones
• Degrees of Unsolvability. (AM-55)
• Extension of embeddings in the computably enumerable degrees
• Lattice embeddings into the recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Non-bounding constructions
• On the degrees less than 0'
• The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable
• The recursively enumerable degrees are dense
• The undecidability of the recursively enumerable degrees
• Working below a high recursively enumerable degree

Cited in

(13)

• Minimal pairs in initial segments of the recursively enumerable degrees
• Non-uniformity and generalised Sacks splitting
• Turing computability: structural theory
• Mass problems and density
• Nonexistence of Minimal Pairs in $$L[{\mathbf d}]$$
• Constructing minimal pairs of degrees
• One theorem of Zil′ber's on strongly minimal sets
• On the problem of the critical bound
• On minimal pairs of enumeration degrees
• A minimal pair in the generic degrees
• A Minimal Pair in the Quotient Structure M/NCup
• Extending the Cooper minimal pair theorem
• Structural theory of degrees of unsolvability: advances and open problems

This page was built for publication: On the existence of a strong minimal pair

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