43 citations · 50 across the 4 of their papers we have counts for
Showing math.LOShow all
3 papers · 1 filter
math.LO2024
Finite final segments of the d.c.e. Turing degrees
Steffen Lempp, Yiqun Liu, Yong Liu +3
We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a…
math.LO2016
On the existence of a strong minimal pair
George Barmpalias, Mingzhong Cai, Steffen Lempp +1
We show that there is a strong minimal pair in the computably enumerable Turing degrees.
math.LO2014★ 43 cited
The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
Denis R. Hirschfeldt, Carl G. Jockusch, Bjørn Kjos-Hanssen +2
We study the reverse mathematics and computability-the\-o\-re\-tic strength of (stable) Ramsey's Theorem for pairs and the related principles COH and DNR. We show that SRT im…