More on Cichon's Diagram and Infinite Games
Kada, Masaru
J. Symbolic Logic, Tome 65 (2000) no. 1, p. 1713-1724 / Harvested from Project Euclid
Some cardinal invariants from Cichon's diagram can be characterized using the notion of cut-and-choose games on cardinals. In this paper we give another way to characterize those cardinals in terms of infinite games. We also show that some properties for forcing, such as the Sacks Property, the Laver Property and $\omega^\omega$-boundingness, are characterized by cut-and-choose games on complete Boolean algebras.
Publié le : 2000-12-14
Classification:  03E99,  04A99,  90D44
@article{1183746259,
     author = {Kada, Masaru},
     title = {More on Cichon's Diagram and Infinite Games},
     journal = {J. Symbolic Logic},
     volume = {65},
     number = {1},
     year = {2000},
     pages = { 1713-1724},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183746259}
}
Kada, Masaru. More on Cichon's Diagram and Infinite Games. J. Symbolic Logic, Tome 65 (2000) no. 1, pp.  1713-1724. http://gdmltest.u-ga.fr/item/1183746259/