The 2-tactic conjecture for the strongly monotonic game
The 2-tactic conjecture for the strongly monotonic game
Let be an infinite cardinal. In the game , player ONE plays an increasing sequence of members of the generated ideal and TWO responds with members of ; a winning 2-tactic is a winning strategy for TWO depending only on the last two moves of ONE. The 2-tactic conjecture. Player TWO has a winning 2-tactic in the game
for each infinite cardinal number . The conjecture is motivated by consistency results establishing analogous 2-tactic conclusions for broad classes of cardinals and by the known 3-tactic result for the very strong game. It seeks a ZFC result without additional set-theoretic hypotheses.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Tomek Bartoszynski, Winfried Just and Marion Scheepers, “Covering games and the Banach-Mazur game: k-tactics”, arXiv:math/9207203 (1992).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.