Stable Ramsey's theorem and measure

Details Stable Ramsey's theorem and measure Stable Ramsey's theorem and measure

2010-10-11

arxiv.org/abs/1010.2230v1

Mathematics

Logic

Accepted for publication in Notre Dame Journal of Formal Logic

Scientific paper

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 non-null in a certain effective measure-theoretic sense. We show that the sets that can compute infinite homogeneous sets for non-null many computable stable colorings and the sets that can compute infinite homogeneous sets for all computable stable colorings agree below $\emp'$ 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 $\mathsf{COH}$ or $\mathsf{WKL}_0$ in the context of reverse mathematics.

Affiliated with

Also associated with

No associations

Rating

Stable Ramsey's theorem and measure does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stable Ramsey's theorem and measure, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stable Ramsey's theorem and measure will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-607117