How to win some simple iteration games
From MaRDI portal
Publication:5961723
Abstract: We introduce two new iteration games: the game G, which is a strengthening of the weak iteration game, and the game G+, which is somewhat stronger than G but weaker than the full iteration game of length omega_1. For a countable M elementarily embeddable in some V_{eta}, we can show that II wins G(M,omega_1) and that I does not win the G+(M).
Recommendations
- scientific article; zbMATH DE number 3875257
- Measurable cardinals and the cardinality of Lindelöf spaces
- Determinacy axioms and large cardinals
- Winning strategies in club games and their applications
- The self-iterability of L[E]
- On coherent families of finite-to-one functions
- Playing with Mathias
- A universal extender model without large cardinals in V
- Iteration Trees
- Provably \(\Delta_1\) games
Cites work
Cited in
(5)
This page was built for publication: How to win some simple iteration games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961723)