Reverse Mathematics, Computability, and Partitions of TreesMathematics
AbstractWe 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.
Citation InformationJennifer Chubb, Jeffry L. Hirst and Timothy H. McNicholl. "Reverse Mathematics, Computability, and Partitions of Trees" (2009)
Available at: http://works.bepress.com/timothy-mcnicholl/21/