Title

Reverse Mathematics, Computability, and Partitions of Trees

Authors

Jennifer Chubb, University of San FranciscoFollow
Jeffry L. Hirst
Timothy H. McNicholl

Document Type

Article

Publication Date

3-2009

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.

Comments

Article published in The Journal of Symbolic Logic Volume 74, Number 1,March 2009.

c 2009, Association for Symbolic Logic 0022-4812/09/7401-0011

Recommended Citation

Chubb, Jennifer; Hirst, Jeffry L.; and McNicholl, Timothy H., "Reverse Mathematics, Computability, and Partitions of Trees" (2009). Mathematics. 4.
https://repository.usfca.edu/math/4