Complexity of Ramsey null sets

DOI10.1016/j.aim.2012.03.001zbMath1259.03062arXiv1003.5983OpenAlexW1986518393MaRDI QIDQ436231

Marcin Sabok

Publication date: 20 July 2012

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.5983

zbMATH Keywords

Polish space\(\sigma\)-idealMathias forcing\(\Sigma^1_2\)-complete setsRamsey measurable setsRamsey null setsZFC-correct

Mathematics Subject Classification ID

Descriptive set theory (03E15) Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (5)

Filter-Laver measurability ⋮ Polarized partitions on the second level of the projective hierarchy ⋮ Playing with Mathias ⋮ A complexity problem for Borel graphs ⋮ A characterization of $\boldsymbol {\Sigma }_{2}^{1}$ sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polarized partitions on the second level of the projective hierarchy
• Forcing absoluteness and regularity properties
• \(\Delta^ 1_ 2\)-sets of reals
• Topology and descriptive set theory
• Some Complete ∑ 1 2 Sets in Harmonic Analysis
• Introduction to Ramsey Spaces (AM-174)
• On the determinacy of games on ordinals
• A new proof that analytic sets are Ramsey
• On the concept of 𝑃𝑖₁¹-completeness
• Borel sets and Ramsey's theorem
• Linear algebraic groups and countable Borel equivalence relations
• Set Theory
• Every analytic set is Ramsey

This page was built for publication: Complexity of Ramsey null sets