Computability in uncountable Binary Trees. - Reese Johnston (J. Symb. Log., 2019)

Cantor-Bendixson ranks of effectively closed sets in admissible recursion theory. - Reese Johnston (Comput., 2020)

Complexity of Index Sets of Descriptive Set-Theoretic Notions. - Reese Johnston; Dilip Raghavan (J. Symb. Log., 2022)