Stable Ramsey's Theorem and Measure

Notre Dame Journal of Formal Logic 52 (1):95-112 (2011)
  Copy   BIBTEX

Abstract

The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are nonnull in a certain effective measure-theoretic sense. We show that the sets that can compute infinite homogeneous sets for nonnull many computable stable colorings and the sets that can compute infinite homogeneous sets for all computable stable colorings agree below $\emptyset'$ but not in general. We also answer the analogs of two well-known questions about the stable Ramsey's theorem by showing that our weaker principle does not imply COH or WKL 0 in the context of reverse mathematics

Links

PhilArchive



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

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

Ramsey sets, the Ramsey ideal, and other classes over R.Paul Corazza - 1992 - Journal of Symbolic Logic 57 (4):1441 - 1468.
`Sex-Equal' Stable Matchings.Antonio Romero-Medina - 2001 - Theory and Decision 50 (3):197-212.
A recursion theoretic analysis of the clopen Ramsey theorem.Peter Clote - 1984 - Journal of Symbolic Logic 49 (2):376-400.
A Simple Proof and Some Difficult Examples for Hindman's Theorem.Henry Towsner - 2012 - Notre Dame Journal of Formal Logic 53 (1):53-65.
On the Ramsey property for sets of reals.Ilias G. Kastanas - 1983 - Journal of Symbolic Logic 48 (4):1035-1045.
Small stable groups and generics.Frank O. Wagner - 1991 - Journal of Symbolic Logic 56 (3):1026-1037.
Expansions of models of ω-stable theories.Steven Buechler - 1984 - Journal of Symbolic Logic 49 (2):470-477.
Simple stable homogeneous groups.Alexander Berenstein - 2003 - Journal of Symbolic Logic 68 (4):1145-1162.
Generalized cohesiveness.Tamara Hummel & Carl G. Jockusch - 1999 - Journal of Symbolic Logic 64 (2):489-516.
The classification of small weakly minimal sets. II.Steven Buechler - 1988 - Journal of Symbolic Logic 53 (2):625-635.
One theorem of Zil′ber's on strongly minimal sets.Steven Buechler - 1985 - Journal of Symbolic Logic 50 (4):1054-1061.
On atomic or saturated sets.Ludomir Newelski - 1996 - Journal of Symbolic Logic 61 (1):318-333.
Sous-groupes periodiques d'un groupe stable.Bruno Poizat & Frank Wagner - 1993 - Journal of Symbolic Logic 58 (2):385-400.

Analytics

Added to PP
2010-12-14

Downloads
28 (#500,423)

6 months
8 (#175,379)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Reverse mathematics and a Ramsey-type König's Lemma.Stephen Flood - 2012 - Journal of Symbolic Logic 77 (4):1272-1280.
A strong law of computationally weak subsets.Bjørn Kjos-Hanssen - 2011 - Journal of Mathematical Logic 11 (1):1-10.
Reverse Mathematics and Ramsey Properties of Partial Orderings.Jared Corduan & Marcia Groszek - 2016 - Notre Dame Journal of Formal Logic 57 (1):1-25.

Add more citations

References found in this work

Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
Ramsey's theorem and recursion theory.Carl G. Jockusch - 1972 - Journal of Symbolic Logic 37 (2):268-280.
Measure theory and weak König's lemma.Xiaokang Yu & Stephen G. Simpson - 1990 - Archive for Mathematical Logic 30 (3):171-180.
A cohesive set which is not high.Carl Jockusch & Frank Stephan - 1993 - Mathematical Logic Quarterly 39 (1):515-530.

View all 10 references / Add more references