Reverse mathematics and Ramsey's property for trees

Abstract

Abstract We show, relative to the base theory RCA 0 : 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 0 . Ramsey's Theorem for singletons for the complete binary tree is stronger than . 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 [3].