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 ${\mathsf{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…