arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2607.03444math.LO
收藏

关于不可数长度的切选博弈的决定性

On Determinacy for Cut and Choose Games of Uncountable Length

Maxwell Levine

AI总结:

研究关于完备布尔代数的切选博弈,在适当类超紧基数一致性假设下,证明极限版本博弈对所有完备布尔代数和后继基数λ一致可决定,还表明博弈不可决定实例与其他性质的关系。

摘要:

我们得到了关于完备布尔代数的切选博弈的结果。Zapletal证明存在一个布尔代数𝔹,使得在第ω轮结束的博弈版本𝒢_ω^𝖼𝖺𝗇𝖽𝖼(𝔹)是不可决定的。我们证明,假设适当类超紧基数的一致性,对于所有完备布尔代数𝔹和所有后继基数λ,极限版本𝒢^𝖼𝖺𝗇𝖽𝖼_<λ(𝔹)是一致可决定的。特别地,这回答了Zapletal的一个问题。我们还表明博弈𝒢^𝖼𝖺𝗇𝖽𝖼_λ(𝔹)的不可决定实例可从可及性性质推出,并证明不可决定实例与MM++兼容。

英文摘要:

We obtain results on cut and choose games for complete Boolean algebras. Zapletal proved that there is a Boolean algebra $\mathbb{B}$ such that $\mathcal{G}_ω^\textsf{candc}(\mathbb{B})$, the version of the game which ends on the $ω$'th round, is undetermined. We prove that, assuming the consistency of a proper class of supercompact cardinals, the limit version $\mathcal{G}^{\textsf{candc}}_{< λ}(\mathbb{B})$, in which there are $λ$-many rounds but no concluding round, is consistently determined for all complete Boolean algebras $\mathbb{B}$ and all successor cardinals $λ$. In particular, this answers a question of Zapletal \cite[Question 2]{Zapletal1995}. We also show that undetermined instances of the game $\mathcal{G}^\textsf{candc}_λ(\mathbb{B})$ follow from the approachability property, extending results of Dobrinen, and we prove that undetermined instances are compatible with $\textsf{MM}^{++}$.

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

↑