7 citations · 7 across the 4 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2022
On the Nonexistence of a Strong Minimal Pair
Mingzhong Cai, Yiqun Liu, Yong Liu +2
Two nonzero recursively enumerable (r.e.) degrees and form a strong minimal pair if and $\mathbf{b}\vee \mathbf{…
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.