Reverse Mathematics, Computability, and Partitions of Trees

We examine the reverse mathematics and computability theory of a form of Ramsey’s theorem in which the linear n-tuples of a binary tree are colored