A 2-Minimal non-Gl2 degree. - Mingzhong Cai (J. Math. Log., 2010)

A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree. - Mingzhong Cai (Notre Dame J. Formal Log., 2010)

Three Theorems on n-REA Degrees: Proof-Readers and Verifiers. - Mingzhong Cai (CiE, 2011)

The n-R.E. Degrees: Undecidability and σ1 Substructures. - Mingzhong Cai; Richard A. Shore; Theodore A. Slaman (J. Math. Log., 2012)

Array nonrecursiveness and relative recursive enumerability. - Mingzhong Cai (J. Symb. Log., 2012)

Domination, forcing, array nonrecursiveness and relative recursive enumerability. - Mingzhong Cai; Richard A. Shore (J. Symb. Log., 2012)

Degrees of Relative Provability. - Mingzhong Cai (Notre Dame J. Formal Log., 2012)

Low level nondefinability results: Domination and recursive enumeration. - Mingzhong Cai; Richard A. Shore (J. Symb. Log., 2013)

2-Minimality, jump classes and a note on natural definability. - Mingzhong Cai (Ann. Pure Appl. Log., 2014)

Random strings and tt-degrees of Turing complete C.E. sets. - Mingzhong Cai; Rodney G. Downey; Rachel Epstein; Steffen Lempp; Joseph S. Miller (Log. Methods Comput. Sci., 2014)

On the existence of a strong minimal pair. - George Barmpalias; Mingzhong Cai; Steffen Lempp; Theodore A. Slaman (J. Math. Log., 2015)

Unprovability and Proving Unprovability. - Mingzhong Cai (Stud Logica, 2015)

On Kalimullin pairs. - Mingzhong Cai; Steffen Lempp; Joseph S. Miller; Mariya Ivanova Soskova (Comput., 2016)

The complements of Lower cones of Degrees and the degree spectra of Structures. - Uri Andrews; Mingzhong Cai; Iskander Sh. Kalimullin; Steffen Lempp; Joseph S. Miller; Antonio Montalbán (J. Symb. Log., 2016)

Limit computability and ultrafilters. - Uri Andrews; Mingzhong Cai; David Diamondstone; Noah Schweber (Comput., 2023)