Some game-theoretic characterizations for rapid filters on \(\omega\). (English) Zbl 07680696
Summary: 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 \(\omega\).
References:
| [1] | Aurichi, L. F.; Dias, R. R., A minicourse on topological game, Topology and its Applications, 258, 305-335 (2019) · Zbl 1411.91151 · doi:10.1016/j.topol.2019.02.057 |
| [2] | Bartoszynski, T.; Judah, H., Set Theory: On the Structure of the Real Line (1995), Massachusetts: A. K. Peters, Massachusetts · Zbl 0834.04001 · doi:10.1201/9781439863466 |
| [3] | Bartoszynski, T.; Scheepers, M., Filters and games, Proc. Amer. Math. Soc., 123, 2529-2534 (1995) · Zbl 0829.90148 · doi:10.1090/S0002-9939-1995-1249868-8 |
| [4] | Kechris, A. S., Classical Descriptive Set Theory (1995), New York: Springer-Verlag, New York · Zbl 0819.04002 · doi:10.1007/978-1-4612-4190-4 |
| [5] | Laflamme, C., Filter games and combinatorial properties of winning strategies, Contemp. Math., 192, 51-67 (1996) · Zbl 0854.04004 · doi:10.1090/conm/192/02348 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
