Hostname: page-component-cb9f654ff-nr592 Total loading time: 0 Render date: 2025-08-28T11:42:38.991Z Has data issue: false hasContentIssue false

INFINITE GAMES AND RAMSEY PROPERTIES OF $F_\sigma $ IDEALS

Part of: Set theory

Published online by Cambridge University Press:  17 February 2025

JOSÉ DE JESÚS PELAYO-GÓMEZ*
Affiliation:
SOFTWARE ENGINEERING, VIASAT, INC. 6155 EL CAMINO REAL CARLSBAD, CA 92009 UNITED STATES

Abstract

In this work, we investigate various combinatorial properties of Borel ideals on countable sets. We extend a theorem presented in [13] and identify an $F_\sigma $ tall ideal in which player II has a winning strategy in the Cut and Choose Game, thereby addressing a question posed by J. Zapletal. Additionally, we explore the Ramsey properties of ideals, demonstrating that the random graph ideal is critical for the Ramsey property when considering more than two colors. The previously known result for two colors is extended to any finite number of colors. Furthermore, we comment on the Solecki ideal and identify an $F_\sigma $ tall K-uniform ideal that is not equivalent to $\mathcal {ED}_{\text {fin}}$, thereby addressing a question from M. Hrušák’s work [10].

Information

Type
Article
Copyright
© The Author(s), 2025. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Balcar, B., Hernández-Hernández, F., and Hrušák, M., Combinatorics of dense subsets of the rationals . Fundamenta Mathematicae , vol. 183 (2004), pp. 5980.Google Scholar
Bartoszyński, T. and Judah, H., Set Theory: On the Structure of the Real Line , A. K. Peters, Wellesley, MA, 1995.Google Scholar
Baumgartner, J. E., Ultrafilters on $\omega$ . Journal of Symbolic Logic , vol. 60 (1995), no. 2, pp. 624639.Google Scholar
Baumgartner, J. and Taylor, A., Partition theorems and ultrafilters . Transactions of the American Mathematical Society , vol. 241 (1978), pp. 183309.Google Scholar
Cameron, P., The random graph . The Mathematics of Paul Erdös II , vol. 14 (1997), pp. 333351.Google Scholar
Di Prisco, C., Mijares, J., and Uzcátegui, C., Ideal games and Ramsey sets . Proceedings of the American Mathematical Society , vol. 140 (2012), no. 7, pp. 22552265.Google Scholar
Hrušák, M., Combinatorics of filters and ideals . Contemporary Mathematics , vol. 533 (2011), no. 8, pp. 2969.Google Scholar
Hrušák, M., Katětov order on Borel ideals . Archive for Mathematical Logic . vol. 56, pp. 831847.Google Scholar
Hrušák, M., Meza-Alcántara, D., Thümmel, E., and Uzcátegui, C., Ramsey type properties of ideals . Annals of Pure and Applied Logic , vol. 168 (2017), pp. 20222049.Google Scholar
Kechris, A. S., Classical Descriptive Set Theory , Springer-Verlag, Berlin, Germany, 1995.Google Scholar
Kunen, K., Set Theory , Studies in Logic 34, College Publications, London, United Kingdom, 2011.Google Scholar
Laczkovich, M. and Rec law, I., Ideal limits of sequences of continuous functions . Fundamenta Mathematicae , vol. 203 (2009), no. 1, pp. 3946.Google Scholar
Laflamme, C., Filter games and combinatorial properties of strategies , Set Theory (Boise, ID, 1992–1994) (G. M. Hjorth, editor), volume 192 of Contemporary Mathematics, American Mathematical Society, Providence, RI, 1996, pp. 5167.Google Scholar
Mazur, K., ${F}_{\sigma }$ -ideals and ${\omega}_1{\omega}_1^{\ast }$ -gaps in the Boolean algebras $P\left(\omega \right)/I$ . Fundamenta Mathematicae , vol. 138 (1991), no. 2, pp. 103111.Google Scholar
Meza-Alcántara, D., Ideals and filters on countable sets , Ph.D. thesis, UNAM, Mexico 2009.Google Scholar