Skip to main content
Article
Reverse mathematics, computability, and partitions of trees
The Journal of Symbolic Logic (2009)
  • Jennifer Chubb, The George Washington University
  • Jeffry L. Hirst, Appalachian State University
  • Timothy H. McNicholl, Lamar University
Abstract
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.
Publication Date
March, 2009
DOI
10.2178/jsl/1231082309
Publisher Statement
This article is published as Chubb, Jennifer, Jeffry L. Hirst, and Timothy H. McNicholl. "Reverse mathematics, computability, and partitions of trees." The Journal of Symbolic Logic 74, no. 1 (2009): 201-215. doi: 10.2178/jsl/1231082309. Posted with permission.

© Association for Symbolic Logic 2009
Citation Information
Jennifer Chubb, Jeffry L. Hirst and Timothy H. McNicholl. "Reverse mathematics, computability, and partitions of trees" The Journal of Symbolic Logic Vol. 74 Iss. 1 (2009) p. 201 - 215
Available at: http://works.bepress.com/timothy-mcnicholl/37/