Complexity of Ramsey null sets

Details Complexity of Ramsey null sets Complexity of Ramsey null sets

2010-03-31

arxiv.org/abs/1003.5983v1

Mathematics

Logic

Scientific paper

We show that the set of codes for Ramsey positive analytic sets is $\mathbf{\Sigma}^1_2$-complete. This is a one projective-step higher analogue of the Hurewicz theorem saying that the set of codes for uncountable analytic sets is $\mathbf{\Sigma}^1_1$-complete. This shows a close resemblance between the Sacks forcing and the Mathias forcing. In particular, we get that the $\sigma$-ideal of Ramsey null sets is not ZFC-correct. This solves a problem posed by Ikegami, Pawlikowski and Zapletal.

Affiliated with

Also associated with

No associations

Rating

Complexity of Ramsey null sets 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 Complexity of Ramsey null sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of Ramsey null sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-579746