On the existence of a strong minimal pair

arxiv: 1610.03591 · v1 · pith:7PTFXMQLnew · submitted 2016-10-12 · 🧮 math.LO

George Barmpalias , Mingzhong Cai , Steffen Lempp , Theodore A. Slaman This is my paper

classification 🧮 math.LO

keywords minimalpairstrongcomputablydegreesenumerableexistencethere

0 comments

read the original abstract

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

This paper has not been read by Pith yet.