activity
20182026
most citedFinding descending sequences through ill-founded linear orders

11 citations · 12 across the 8 of their papers we have counts for

collaborators

8 papers

math.LO2026

Categoricity without Power

Jun Le Goh, Chieu-Minh Tran

We prove an analogue of Morley's categoricity theorem where cardinality is replaced by the recursion-theoretic notion of arithmetic degree. We say that a complete arithmetically de…

math.CO2026

Finite combinatorics and computability theory

Damir D. Dzhafarov, Jun le Goh

We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reform…

math.LO2024

The weakness of finding descending sequences in ill-founded linear orders

Jun Le Goh, Arno Pauly, Manlio Valenti

We explore the Weihrauch degree of the problems ``find a bad sequence in a non-well quasi order'' () and ``find a descending sequence in an ill-founded linear order''…

math.LO2023

Halin's Infinite Ray Theorems: Complexity and Reverse Mathematics: Version E

James S. Barnes, Jun Le Goh, Richard A. Shore

Halin [1965] proved that if a graph has many pairwise disjoint rays for each then it has infinitely many pairwise disjoint rays. We analyze the complexity of this and other…

math.LO2023

Redundancy of information: lowering dimension

Jun Le Goh, Joseph S. Miller, Mariya I. Soskova +1

Let At denote the set of infinite sequences of effective dimension t. We determine both how close and how far an infinite sequence of dimension s can be from one of dimension t, me…

math.LO2020★ 11 cited

Finding descending sequences through ill-founded linear orders

Jun Le Goh, Arno Pauly, Manlio Valenti

In this work we investigate the Weihrauch degree of the problem of finding an infinite descending sequence through a given ill-founded linear order, which is shared b…

math.LO2019

Some computability-theoretic reductions between principles around

Jun Le Goh

We study the computational content of various theorems with reverse mathematical strength around Arithmetical Transfinite Recursion () from the point of view of com…

math.LO2018★ 1 cited

Ramsey's theorem and products in the Weihrauch degrees

Damir D. Dzhafarov, Jun Le Goh, Denis R. Hirschfeldt +2

We study the positions in the Weihrauch lattice of parallel products of various combinatorial principles related to Ramsey's theorem. Among other results, we obtain an answer to a…