Some Game-Theoretic Characterizations for Rapid Filters on ω

Abstract

Infinite game is a power tool in studying various objects and finding descriptions of some properties of filters in mathematics. Game-theoretic characterizations for meager filters, Q-filters and Ramsey filters were obtained by Tomek Bartoszynski, Claude Laflamme and Marion Scheepers. In this paper, the authors obtain two game-theoretic characterizations for rapid filters on ω.

Keywords

Rapid filter / Infinite game / Game-theoretic characterization

References

[1] Aurichi L F, Dias R R. A minicourse on topological game. Topology and its Applications, 2019, 258: 305-335

[2] Bartoszynski T, Judah H. Set Theory: On the Structure of the Real Line, 1995, Massachusetts: A. K. Peters

[3] Bartoszynski T, Scheepers M. Filters and games. Proc. Amer. Math. Soc., 1995, 123: 2529-2534

[4] Kechris A S. Classical Descriptive Set Theory, 1995, New York: Springer-Verlag

[5] Laflamme C. Filter games and combinatorial properties of winning strategies. Contemp. Math., 1996, 192: 51-67