Playful Boolean algebras
HTML articles powered by AMS MathViewer
- by Boban Veličković
- Trans. Amer. Math. Soc. 296 (1986), 727-740
- DOI: https://doi.org/10.1090/S0002-9947-1986-0846604-0
- PDF | Request permission
Abstract:
We show that for an atomless complete Boolean algebra $\mathcal {B}$ of density $\leq {2^{{\aleph _0}}}$, the Banach-Mazur, the split and choose, and the Ulam game on $\mathcal {B}$ are equivalent. Moreover, one of the players has a winning strategy just in trivial cases: Empty wins iff $\mathcal {B}$ adds a real; Nonempty wins iff $\mathcal {B}$ has a $\sigma$-closed dense set. This extends some previous results of Foreman, Jech, and VojtášReferences
- Bohuslav Balcar, Jan Pelant, and Petr Simon, The space of ultrafilters on $\textbf {N}$ covered by nowhere dense sets, Fund. Math. 110 (1980), no. 1, 11–24. MR 600576, DOI 10.4064/fm-110-1-11-24
- Keith J. Devlin, Constructibility, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1984. MR 750828, DOI 10.1007/978-3-662-21723-8
- Matthew Foreman, Games played on Boolean algebras, J. Symbolic Logic 48 (1983), no. 3, 714–723. MR 716633, DOI 10.2307/2273464 C. Gray, Iterated forcing from the strategic point of view, Ph.D. Thesis, Univ. of California, Berkeley, 1980.
- F. Galvin, T. Jech, and M. Magidor, An ideal game, J. Symbolic Logic 43 (1978), no. 2, 284–292. MR 485391, DOI 10.2307/2272827
- John Gregory, Higher Souslin trees and the generalized continuum hypothesis, J. Symbolic Logic 41 (1976), no. 3, 663–671. MR 485361, DOI 10.2307/2272043
- Thomas Jech, A game theoretic property of Boolean algebras, Logic Colloquium ’77 (Proc. Conf., Wrocław, 1977) Studies in Logic and the Foundations of Mathematics, vol. 96, North-Holland, Amsterdam-New York, 1978, pp. 135–144. MR 519808
- Thomas Jech, Set theory, Pure and Applied Mathematics, Academic Press [Harcourt Brace Jovanovich, Publishers], New York-London, 1978. MR 506523
- Thomas J. Jech, More game-theoretic properties of Boolean algebras, Ann. Pure Appl. Logic 26 (1984), no. 1, 11–29. MR 739910, DOI 10.1016/0168-0072(84)90038-1
- A. Kanamori and M. Magidor, The evolution of large cardinal axioms in set theory, Higher set theory (Proc. Conf., Math. Forschungsinst., Oberwolfach, 1977) Lecture Notes in Math., vol. 669, Springer, Berlin, 1978, pp. 99–275. MR 520190
- Kenneth Kunen, Some applications of iterated ultrapowers in set theory, Ann. Math. Logic 1 (1970), 179–227. MR 277346, DOI 10.1016/0003-4843(70)90013-6
- K. Kunen and J. B. Paris, Boolean extensions and measurable cardinals, Ann. Math. Logic 2 (1970/71), no. 4, 359–377. MR 277381, DOI 10.1016/0003-4843(71)90001-5
- Richard Laver and Saharon Shelah, The $\aleph _{2}$-Souslin hypothesis, Trans. Amer. Math. Soc. 264 (1981), no. 2, 411–417. MR 603771, DOI 10.1090/S0002-9947-1981-0603771-7 D. Mauldin, ed., The Scottish book, Birkhäuser, Boston, Mass., 1981. J. Mycielski, Problem 446, Colloq. Math. 11 (1963), 139.
- Kanji Namba, Independence proof of $(\omega ,\,\omega _{\alpha })$-distributive law in complete Boolean algebras, Comment. Math. Univ. St. Paul. 19 (1971), 1–12. MR 297548
- K. L. Prikry, Changing measurable into accessible cardinals, Dissertationes Math. (Rozprawy Mat.) 68 (1970), 55. MR 262075
- Saharon Shelah, Proper forcing, Lecture Notes in Mathematics, vol. 940, Springer-Verlag, Berlin-New York, 1982. MR 675955, DOI 10.1007/978-3-662-21543-2
- S. Shelah and L. Stanley, $S$-forcing. I. A “black-box” theorem for morasses, with applications to super-Souslin trees, Israel J. Math. 43 (1982), no. 3, 185–224. MR 689979, DOI 10.1007/BF02761942
- Robert M. Solovay, Real-valued measurable cardinals, Axiomatic Set Theory (Proc. Sympos. Pure Math., Vol. XIII, Part I, Univ. California, Los Angeles, Calif., 1967) Amer. Math. Soc., Providence, R.I., 1971, pp. 397–428. MR 0290961
- S. Todorčević, Trees and linearly ordered sets, Handbook of set-theoretic topology, North-Holland, Amsterdam, 1984, pp. 235–293. MR 776625
- S. Ulam, Combinatorial analysis in infinite sets and some physical theories, SIAM Rev. 6 (1964), 343–355. MR 170832, DOI 10.1137/1006090 P. Vojtáš, A transfinite Boolean game and a generalization of Kripke’s embedding theorem, General Topology and its Relations to Modern Analysis and Algebra. ${\text {V}}$ (Proc. Fifth Prague Sympos., 1981), Helderman Verlag, Berlin, 1982, pp. 663-668.
- Peter Vojtáš, Game properties of Boolean algebras, Comment. Math. Univ. Carolin. 24 (1983), no. 2, 349–369. MR 711272
Bibliographic Information
- © Copyright 1986 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 296 (1986), 727-740
- MSC: Primary 06E10; Secondary 03E40, 03G05
- DOI: https://doi.org/10.1090/S0002-9947-1986-0846604-0
- MathSciNet review: 846604