Abstract
AbstractWe characterize the (κ, λ, < μ)-distributive law in Boolean algebras in terms of cut and choose games , when μ ≤ κ ≤ λ and κ<κ = κ. This builds on previous work to yield game-theoretic characterizations of distributive laws for almost all triples of cardinals κ, λ, μ with μ ≤ λ, under GCH. In the case when μ ≤ κ ≤ λ and κ<κ = κ, we show that it is necessary to consider whether the κ-stationarity of in the ground model is preserved by . In this vein, we develop the theory of κ-club and κ-stationary subsets of . We also construct Boolean algebras in which Player I wins but the (κ, ∞, κ)-d.1. holds, and, assuming GCH, construct Boolean algebras in which many games are undetermined.
Publisher
Cambridge University Press (CUP)
Reference26 articles.
1. More on the cut and choose game
2. Piper Gregory , Regular clubs in P κ λ, preprint.
3. Piper Gregory , Regular closure and corresponding P κ λ versions of ◊ and ♣. preprint.
4. Piper Gregory , On the combinatorics of P κ λ , Ph.D. thesis, University of East Anglia, 2003.
5. Consistency of Menas' conjecture
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献