For A ⊂ 2ω and X ⊂ ω consider an infinite game Г(A, X) in which two players I and II choose cn ϵ (0,1). cn is chosen by I if n ϵ X and by II if n ϵ ω\X. I wins if (c0, c1, c2,…) ϵ A. We analyze connections between A and the family of all sets X ⊂ ω for which I has a winning strategy in Г(A, X). Certain similarities and differences appear if one formulates these connections in the language of category and of Lebesgue measure.
|Original language||English (US)|
|Number of pages||5|
|Journal||Proceedings of the American Mathematical Society|
|State||Published - Sep 1993|
- Infinite games
ASJC Scopus subject areas
- Applied Mathematics