The 2-tactic conjecture for the strongly monotonic game

From papers

Let κ\kappa be an infinite cardinal. In the game SMG([κ]<0)SMG([\kappa]^{<\aleph_{0}}), player ONE plays an increasing sequence of members of the generated ideal and TWO responds with members of [κ]<0[\kappa]^{<\aleph_{0}}; 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

SMG([κ]<0)SMG([\kappa]^{<\aleph_{0}})

for each infinite cardinal number κ\kappa. 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

No solutions have been posted yet.