Covering games and the Banach-Mazur game: k-tactics
Tomek Bartoszynski, Winfried Just, Marion Scheepers
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 Banach-Mazur game.
Create a lesson
Related papers
Pseudofinite abelian groups and asymptotic classes of finite abelian groups
Carlos Cordoba-Caycedo, Dario Garcia
Spectral Theory and Descriptive Combinatorics for Non-Regular Borel pmp Graphs
Cecelia Higgins, Pieter Spaas, Sofia Torelli
The strength of the minimum principle in constructive reverse mathematics
Tatsuji Kawai
Independence of premise for intuitionistic Zermelo-Fraenkel set theory
Patrick Uftring
Condensed Whitehead Problem
Spencer Unger, Jerry Wei
Points and their multiples on curves in powers of simple abelian varieties
David J. Smith