Measuring the Relative Complexity of Mathematical Constructions and Theorems. - Jun Le Goh (Bull. Symb. Log., 2019)

Embeddings between well-orderings: Computability-theoretic reductions. - Jun Le Goh (Ann. Pure Appl. Log., 2020)

Ramsey's theorem and products in the Weihrauch degrees. - Damir D. Dzhafarov; Jun Le Goh; Denis R. Hirschfeldt; Ludovic Patey; Arno Pauly (Comput., 2020)

Compositions of multivalued functions. - Jun Le Goh (Comput., 2020)

Finding descending sequences through ill-Founded linear Orders. - Jun Le Goh; Arno Pauly; Manlio Valenti (J. Symb. Log., 2021)

Theorems of Hyperarithmetic Analysis and Almost theorems of Hyperarithmetic Analysis. - James S. Barnes; Jun Le Goh; Richard A. Shore (Bull. Symb. Log., 2022)

Extensions of two constructions of Ahmad. - Jun Le Goh; Steffen Lempp; Keng Meng Ng; Mariya Ivanova Soskova (Comput., 2022)

The strength of an Axiom of finite Choice for Branches in Trees. - Jun Le Goh (J. Symb. Log., 2023)

Pa Relative to an Enumeration Oracle. - Jun Le Goh; Iskander Sh. Kalimullin; Joseph S. Miller; Mariya Ivanova Soskova (J. Symb. Log., 2023)

The Weakness of Finding Descending Sequences in Ill-Founded Linear Orders. - Jun Le Goh; Arno Pauly; Manlio Valenti (CiE, 2024)

Halin's infinite ray theorems: Complexity and reverse mathematics. - James S. Barnes; Jun Le Goh; Richard A. Shore (J. Math. Log., 2025)