Covering games and the BanachMazur game: ktactics
Abstract
Given a free ideal J of subsets of a set X, we consider games where player ONE plays an increasing sequence of elements of the sigma completion of J, and TWO tries to cover the union of this sequence by playing one set at a time from J. We describe various conditions under which player TWO has has a winning strategy that uses only information about the most recent k moves of ONE, and apply some of these results to the BanachMazur game.
 Publication:

arXiv Mathematics eprints
 Pub Date:
 July 1992
 arXiv:
 arXiv:math/9207203
 Bibcode:
 1992math......7203B
 Keywords:

 Mathematics  Logic