1 citations · 2 across the 3 of their papers we have counts for
5 papers
Conservation Strength of The Infinite Pigeonhole Principle for Trees
Chitat Chong, Wei Wang, Yue Yang
Let be the combinatorial principle stating that every finite coloring of the infinite full binary tree has a homogeneous isomorphic subtree. Let a…
A recursion theoretic foundation of computation over real numbers
Keng Meng Ng, Nazanin R. Tavana, Yue Yang
We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by Gödel and Kleene.…
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…