\(\kappa \)-stationary subsets of \(\mathcal P_{\kappa ^{+}}\lambda \), infinitary games, and distributive laws in Boolean algebras. (English) Zbl 1142.03031

Jech began the investigation of the the relationships between games and distributivity laws in Boolean algebras. He could show that the \((\omega,\infty)\)-d.l. holds iff player I does not have a winning strategy in the descending sequence game of length \(\omega\).
Here the author characterizes the \((\kappa,\lambda, <\mu)\)-distributivity law in Boolean algebras in terms of the cut and choose games \({\mathcal G}_{<\mu}^{\kappa}(\lambda)\) when \(\mu \leq \kappa \leq \lambda\) and \(\kappa^{<\kappa} = \kappa\). This continues previous work of the author and gives game-theoretic characterizations of distributivity laws for almost all triples of cardinals \(\kappa\), \(\lambda\), \(\mu\) with \(\mu \leq \lambda\), under GCH. To obtain the results, it is necessary to consider whether the \(\kappa\)-stationarity of \({\mathcal P}_{\kappa^+} \lambda\) in the ground model is preserved by \(\mathbb B\).
The author develops the theory of \(\kappa\)-club and \(\kappa\)-stationary subsets of \({\mathcal P}_{\kappa^+} \lambda\). Further on she constructs a Boolean algebra in which player I has a winning strategy for \({\mathcal G}_{\kappa}^{\kappa}(\kappa^+)\) but the \((\kappa, \infty, \kappa)\)-d.l. holds. Assuming GCH, she constructs Boolean algebras in which many games are undetermined.


03E40 Other aspects of forcing and Boolean-valued models
03E05 Other combinatorial set theory
06E05 Structure theory of Boolean algebras
91A44 Games involving topology, set theory, or logic
Full Text: DOI Euclid


[1] DOI: 10.1305/ndjfl/1093636521 · Zbl 0614.03033
[2] DOI: 10.1016/0168-0072(95)00002-X · Zbl 0849.03043
[3] DOI: 10.1090/S0002-9947-1990-0939805-5
[4] DOI: 10.1007/s00153-003-0185-z · Zbl 1059.03025
[5] DOI: 10.1007/s001530050138 · Zbl 0959.03030
[6] DOI: 10.1016/0168-0072(94)00031-W · Zbl 0837.03040
[7] DOI: 10.1090/S0002-9939-02-06501-2 · Zbl 1004.03040
[8] Annals of Pure and Applied Logic
[9] Adding a closed unbounded set 41 pp 481– (1976)
[10] Forcing closed and unbounded sets 48 pp 643– (1983)
[11] DOI: 10.1016/0003-4843(77)90010-9 · Zbl 0364.02009
[12] DOI: 10.1090/S0002-9904-1972-12921-5 · Zbl 0264.02017
[13] Handbook on Boolean algebras 1 (1989)
[14] The Higher Infinite (2003)
[15] DOI: 10.1016/0003-4843(80)90021-2 · Zbl 0453.03056
[16] DOI: 10.1016/0168-0072(94)90077-9 · Zbl 0798.03054
[17] Set theory (2003)
[18] Multiple forcing (1986)
[19] DOI: 10.1016/0168-0072(84)90038-1 · Zbl 0555.03025
[20] A game theoretic property of Boolean algebras 96 (1978) · Zbl 0466.90100
[21] DOI: 10.2969/jmsj/04220259 · Zbl 0704.03032
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.