Elementary Submodels, Coding Strategies, and an Infinite Real Number Game
Keywords:
elementary submodels, infinite-length games, strategiesAbstract
Matthew Baker [Math. Mag. 80 (2007), no. 5, pp. 377-380] investigates an elegant infinite-length game that may be used to study subsets of real numbers. We present two accessible examples of how an import ant technique from set theory or a different technique from infinite game theory may be used to answer Baker's question on whether this game provides a precise characterization for countable subsets of real numbers, and we connect this game to the well-studied Banach-Mazur game from topology.
References
Matthew H. Baker, Uncountable sets and an infinite real number game, Math. Mag. 80 (2007), no. 5, 377-380.
Available at http://www.jstor.org/stable/27643064.
Will Brian, Alan Dow, David Milovich, and Lynne Yengulalp, Telgársky's conjecture may fail, Israel J. Math. 242 (2021), no. 1, 325-358.
Alan Dow, An introduction to applications of elementary submodels to topology, Topology Proc. 13 (1988), no. 1, 17-72.
Jerrold W. Grossman and Barry Turett, Problems, Proposals, 1542, Math. Mag. 71 ( 2017), no. 1, 67.
Magnus D. LaDue, The Cantor Game: Winning strategies and determinacy. Available at https://doi.org/10.48550/arXiv.1701.09087.
R. Daniel Mauldin, The Scottish Book: Mathematics from the Scottish Café with Selected Problems from The New Scottish Café. 2nd ed. Springer: 2015.
Rastislav Telgársky, Topological games: On the 50th anniversary of the Banach-Mazur game, Rocky Mountain J. Math. 17 (1987), no. 2, 227-276.
