| Finding descending sequences through ill-founded linear orders J Le Goh, A Pauly, M Valenti The Journal of Symbolic Logic 86 (2), 817-854, 2021 | 28 | 2021 |
| Ramsey’s theorem and products in the Weihrauch degrees DD Dzhafarov, JL Goh, DR Hirschfeldt, L Patey, A Pauly Computability 9 (2), 85-110, 2020 | 18 | 2020 |
| Embeddings between well-orderings: Computability-theoretic reductions J Le Goh Annals of Pure and Applied Logic 171 (6), 102789, 2020 | 8 | 2020 |
| Some computability-theoretic reductions between principles around atr0 J Le Goh to appear, 2018 | 8 | 2018 |
| The strength of an axiom of finite choice for branches in trees J Le Goh The Journal of Symbolic Logic, 1-19, 0 | 6 | |
| Measuring the relative complexity of mathematical constructions and theorems J Le Goh Bulletin of Symbolic Logic 25 (4), 447-448, 2019 | 5 | 2019 |
| Halin’s infinite ray theorems: Complexity and reverse mathematics J Barnes, JL Goh, RA Shore to appear, 2021 | 4 | 2021 |
| Compositions of multivalued functions JL Goh Computability 9 (3-4), 231-247, 2020 | 4 | 2020 |
| Halin's Infinite Ray Theorems: Complexity and Reverse Mathematics: Version E JS Barnes, JL Goh, RA Shore arXiv preprint arXiv:2308.14287, 2023 | 2 | 2023 |
| Theorems of Hyperarithmetic Analysis and Almost Theorems of Hyperarithmetic Analysis JS Barnes, J Le Goh, RA Shore Bulletin of Symbolic Logic 28 (1), 133-149, 2022 | 1 | 2022 |
| Extensions of two constructions of Ahmad JL Goh, S Lempp, KM Ng, MI Soskova Computability 11 (3-4), 269-297, 2022 | 1 | 2022 |
| Redundancy of information: lowering dimension JL Goh, JS Miller, MI Soskova, L Westrick arXiv preprint arXiv:2307.11690, 2023 | | 2023 |
| PA RELATIVE TO AN ENUMERATION ORACLE JUNLE GOH, ISH KALIMULLIN, JS MILLER, MI SOSKOVA | | 2021 |
| Some computability-theoretic reductions between principles around JL Goh arXiv preprint arXiv:1905.06868, 2019 | | 2019 |
| Number theoretic aspects of complex dynamics J Le Goh, A Vaidyanathan | | 2014 |
