The strength of ramsey’s theorem for coloring relatively large sets

&
Journal of Symbolic Logic 79 (1):89-102 (2014)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/jsl.2013.27

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

On the strength of Ramsey's theorem for pairs.Peter A. Cholak, Carl G. Jockusch & Theodore A. Slaman - 2001 - Journal of Symbolic Logic 66 (1):1-55.
The Strength of the Rainbow Ramsey Theorem.Barbara F. Csima & Joseph R. Mileti - 2009 - Journal of Symbolic Logic 74 (4):1310 - 1324.
Ramsey's Theorem and Cone Avoidance.Damir D. Dzhafarov & Carl G. Jockusch - 2009 - Journal of Symbolic Logic 74 (2):557-578.
Reverse Mathematics and the Coloring Number of Graphs.Matthew Jura - 2016 - Notre Dame Journal of Formal Logic 57 (1):27-44.
On the strength of Ramsey's theorem without Σ1 -induction.Keita Yokoyama - 2013 - Mathematical Logic Quarterly 59 (1-2):108-111.
Stable Ramsey's Theorem and Measure.Damir D. Dzhafarov - 2011 - Notre Dame Journal of Formal Logic 52 (1):95-112.
A high dimensional Open Coloring Axiom.Bin He - 2005 - Mathematical Logic Quarterly 51 (5):462-469.
The polarized Ramsey’s theorem.Damir D. Dzhafarov & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (2):141-157.
Infinite lotteries, large and small sets.Luc Lauwers - 2017 - Synthese 194 (6):2203-2209.
On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.
Ramsey's Theorem for Pairs and Provably Recursive Functions.Alexander Kreuzer & Ulrich Kohlenbach - 2009 - Notre Dame Journal of Formal Logic 50 (4):427-444.
Reverse Mathematics and Ramsey Properties of Partial Orderings.Jared Corduan & Marcia Groszek - 2016 - Notre Dame Journal of Formal Logic 57 (1):1-25.
Some Ramsey-type theorems for countably determined sets.Josef Mlček & Pavol Zlatoš - 2002 - Archive for Mathematical Logic 41 (7):619-630.
On the Ramsey property for sets of reals.Ilias G. Kastanas - 1983 - Journal of Symbolic Logic 48 (4):1035-1045.
A Simple Proof and Some Difficult Examples for Hindman's Theorem.Henry Towsner - 2012 - Notre Dame Journal of Formal Logic 53 (1):53-65.

Analytics

Added to PP
2016-06-30

Downloads
25 (#618,847)

6 months
20 (#126,159)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.
On Gödel incompleteness and finite combinatorics.Akihiro Kanamori & Kenneth McAloon - 1987 - Annals of Pure and Applied Logic 33 (C):23-41.

Add more references