On the existence of a strong minimal pair

DOI10.1142/S0219061315500038zbMath1386.03044arXiv1610.03591OpenAlexW1723234438MaRDI QIDQ5501923

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

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

minimal paircomputably enumerable degreesTuring degreesextension of embeddings

Mathematics Subject Classification ID

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

Related Items

Mass problems and density ⋮ Structural theory of degrees of unsolvability: advances and open problems ⋮ Turing computability: structural theory

Cites Work

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