1 citations · 4 across the 5 of their papers we have counts for
5 papers
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 denote the combinatorial principle stating that every -coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an is…
Where Pigeonhole Principles meet König Lemmas
David Belanger, Chitat Chong, Wei Wang +2
We study the pigeonhole principle for -definable injections with domain twice as large as the codomain, and the weak König lemma for -definable trees in which every lev…
On The Computability of Perfect Subsets of Sets with Positive Measure
Chitat Chong, Wei Li, Wei Wang +1
A set 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…
Partial functions and domination
C. T. Chong, Gordon Hoi, Frank Stephan +1
The current work introduces the notion of pdominant sets and studies their recursion-theoretic properties. Here a set A is called pdominant iff there is a partial A-recursive funct…
Ordinal Recursion Theory
Chi Tat Chong, Sy D. Friedman
In this article, intended for the Handbook of Recursion Theory, we survey recursion theory on the ordinal numbers, with sections devoted to -recursion theory, -recursion theo…