C. Chong

most citedThe Strength of Ramsey's Theorem For Pairs over trees: I. Weak König's Lemma

1 citations · 2 across the 2 of their papers we have counts for

collaborators

Showing math.LOShow all

3 papers · 1 filter

math.LO2019★ 1 cited

The Strength of Ramsey's Theorem For Pairs over trees: I. Weak König's Lemma

Chi Tat Chong, Wei Li, Lu Liu +1

Let $TT_{k}^{2}$ denote the combinatorial principle stating that every $k$ -coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an is…

math.LO2019★ 1 cited

Where Pigeonhole Principles meet König Lemmas

David Belanger, Chitat Chong, Wei Wang +2

We study the pigeonhole principle for $Σ_{2}$ -definable injections with domain twice as large as the codomain, and the weak König lemma for $Δ_{2}^{0}$ -definable trees in which every lev…

math.LO2018

On The Computability of Perfect Subsets of Sets with Positive Measure

Chitat Chong, Wei Li, Wei Wang +1

A set $X \subseteq 2^{ω}$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak c…