arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1003.5983math.LO
收藏

Ramsey空集的复杂性

Complexity of Ramsey null sets

Marcin Sabok

摘要:

证明了Ramsey正解析集的码集是$\mathbfΣ^1_2$ -完备的.这是Hurewicz定理的一个更高的投影步骤的模拟,该定理说不可数解析集的代码集是$\mathbfΣ^1_1$ -完全的。这表明Sacks强迫和Mathias强迫之间的密切相似性。特别地,我们得到了Ramsey空集的$σ$ -理想不是ZFC-正确的.这解决了Ikegami,Pawlikowski和Zapletal提出的问题。

英文摘要:

We show that the set of codes for Ramsey positive analytic sets is $\mathbfΣ^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Σ^1_1$-complete. This shows a close resemblance between the Sacks forcing and the Mathias forcing. In particular, we get that the $σ$-ideal of Ramsey null sets is not ZFC-correct. This solves a problem posed by Ikegami, Pawlikowski and Zapletal.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑