Computably Enumerable Equivalence Relations. - Su Gao; Peter M. Gerdes (Stud Logica, 2001)

On n-tardy sets. - Peter Cholak; Peter M. Gerdes; Karen M. Lange (Ann. Pure Appl. Log., 2012)

The degrees of bi-hyperhyperimmune sets. - Uri Andrews; Peter M. Gerdes; Joseph S. Miller (Ann. Pure Appl. Log., 2014)

${ cal D}$-MAXIMAL SETS. - Peter Cholak; Peter M. Gerdes; Karen M. Lange (J. Symb. Log., 2015)

An ω-REA set forming a minimal pair with 0 ′. - Peter M. Gerdes (Comput., 2020)

Extending properly n-REA sets. - Peter Cholak; Peter M. Gerdes (Comput., 2022)

Computability and the Symmetric Difference Operator. - Uri Andrews; Peter M. Gerdes; Steffen Lempp; Joseph S. Miller; Noah David Schweber (Log. J. IGPL, 2022)