Determinateness of Certain Almost-Borel Games
Wolf, Robert S.
J. Symbolic Logic, Tome 50 (1985) no. 1, p. 569-579 / Harvested from Project Euclid
We prove (in ZFC Set Theory) that all infinite games whose winning sets are of the following forms are determined: (1) $(A - S) \cup B$, where $A$ is $\Pi^0_2, \bar\bar{S}, 2^{\aleph_0}$, and the games whose winning set is $B$ is "strongly determined" (meaning that all of its subgames are determined). (2) A Boolean combination of $\Sigma^0_2$ sets and sets smaller than the continuum. This also enables us to show that strong determinateness is not preserved under complementation, improving a result of Morton Davis which required the continuum hypothesis to prove this fact. Various open questions related to the above results are discussed. Our main conjecture is that (2) above remains true when "$\Sigma^0_2$" is replaced by "Borel".
Publié le : 1985-09-14
Classification: 
@article{1183741895,
     author = {Wolf, Robert S.},
     title = {Determinateness of Certain Almost-Borel Games},
     journal = {J. Symbolic Logic},
     volume = {50},
     number = {1},
     year = {1985},
     pages = { 569-579},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183741895}
}
Wolf, Robert S. Determinateness of Certain Almost-Borel Games. J. Symbolic Logic, Tome 50 (1985) no. 1, pp.  569-579. http://gdmltest.u-ga.fr/item/1183741895/