We show, relative to the base theory RCA₀: A nontrivial tree satisfies Ramsey's Theorem only if it is biembeddable with the complete binary tree. There is a class of partial orderings for which Ramsey's Theorem for pairs is equivalent to ACA₀. Ramsey's Theorem for singletons for the complete binary tree is stronger than BΣ⁰₂, hence stronger than Ramsey's Theorem for singletons for ω. These results lead to extensions of results, or answers to questions, of Chubb, Hirst, and McNicholl .
"Reverse mathematics and Ramsey's property for trees." J. Symbolic Logic 75 (3) 945 - 954, September 2010. https://doi.org/10.2178/jsl/1278682209