Games with Filters
Matthew Foreman, Menachem Magidor, and Martin Zeman

TL;DR
This paper explores Welch games, linking game outcomes to large cardinal properties and ideal structures, and constructs models demonstrating various winning strategies and ideal characteristics.
Contribution
It introduces Welch games and establishes their connection to large cardinals, providing models with specific winning strategies and ideal properties.
Findings
Winning strategies characterize large cardinals like weak compactness and measurability.
Existence of models where players win games of certain lengths but not longer.
Construction of models with ideals having specific closure and density properties.
Abstract
This paper has two parts. The first is concerned with a variant of a family of games introduced by Holy and Schlicht, that we call \emph{Welch games}. Player II having a winning strategy in the Welch game of length on is equivalent to weak compactness. Winning the game of length is equivalent to being measurable. We show that for games of intermediate length , II winning implies the existence of precipitous ideals with -closed, -dense trees. The second part shows the first is not vacuous. For each between and , it gives a model where II wins the games of length , but not . The technique also gives models where for all there are -complete, normal, -distributive ideals having dense sets that are -closed, but not…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Economic theories and models · Computability, Logic, AI Algorithms
