Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T13:19:17.575Z Has data issue: false hasContentIssue false

Reverse mathematics, computability, and partitions of trees

Published online by Cambridge University Press:  12 March 2014

Jennifer Chubb
Affiliation:
The George Washington University, Department of Mathematics, 2115 G Street NW, Washington, Dc 20052, USA, E-mail: jchubb@gwu.edu, URL: http://home.gwu.edu/~jchubb
Jeffry L. Hirst
Affiliation:
Appalachian State University, Department of Mathematical Sciences, Boone, Nc 28608, USA, E-mail: jlh@math.appstate.edu, URL: www.mathsci.appstate.edu/~jlh
Timothy H. McNicholl
Affiliation:
Lamar University, Department of Mathematics, 200 Lucas Building, Beaumont, Tx 77710, USA, E-mail: mcnichollth@my.lamar.eduURL: www.math.lamar.edu/faculty/mcnicholl/mcnicholl.asp

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable