Covering Games and the Banach-Mazur Game: K-tactics
Covering Games and the Banach-Mazur Game: K-tactics
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 σ-completion of J , and player TWO tries to cover the union of this sequence by playing one set at a time from …