Reverse mathematics, computability, and partitions of trees

Journal of Symbolic Logic 74 (1):201-215 (2009)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Open questions in reverse mathematics.Antonio Montalbán - 2011 - Bulletin of Symbolic Logic 17 (3):431-454.
Questioning Constructive Reverse Mathematics.I. Loeb - 2012 - Constructivist Foundations 7 (2):131-140.
Reverse mathematics: the playground of logic.Richard A. Shore - 2010 - Bulletin of Symbolic Logic 16 (3):378-402.
Constructivism in mathematics: an introduction.A. S. Troelstra - 1988 - New York, N.Y.: Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.. Edited by D. van Dalen.
On the Indecomposability of $\omega^{n}$.Jared R. Corduan & François G. Dorais - 2012 - Notre Dame Journal of Formal Logic 53 (3):373-395.
Quantum mereotopology.Barry Smith & Berit O. Brogaard - 2002 - Annals of Mathematics and Artificial Intelligence 36 (1):153-175.

Analytics

Added to PP
2010-09-12

Downloads
56 (#279,626)

6 months
8 (#342,364)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Open questions in reverse mathematics.Antonio Montalbán - 2011 - Bulletin of Symbolic Logic 17 (3):431-454.
Partitions of trees and $${{\sf ACA}^\prime_{0}}$$.Bernard A. Anderson & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (3-4):227-230.
Reverse Mathematics and Ramsey Properties of Partial Orderings.Jared Corduan & Marcia Groszek - 2016 - Notre Dame Journal of Formal Logic 57 (1):1-25.

View all 10 citations / Add more citations

References found in this work

No references found.

Add more references