7 citations · 7 across the 4 of their papers we have counts for
4 papers
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.
cs.LO2014★ 7 cited
Random strings and tt-degrees of Turing complete C.E. sets
Mingzhong Cai, Rodney G Downey, Rachel Epstein +2
We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-fr…
math.DG2006
Small Covers over Prisms
Mingzhong Cai, Xin Chen, Zhi Lü
In this paper we calculate the number of equivariant diffeomorphism classes of small covers over a prism.