How to win some simple iteration games
Alessandro Andretta, John R. Steel
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 omega1. For a countable M elementarily embeddable in some Veta, we can show that II wins G(M,omega1) and that I does not win the G+(M).
Create a lesson
Related papers
Friedman--Stanley cofinality without Borel completeness
Ruijun Wang
On Farah ideals and beyond
Adam Kwela
The 1-2-3 Conjecture for Borel Combinatorics
Junhao Chen, Wei Dai
No Borel upper bound for the Fσ equivalence relations
Ruijun Wang
Omitting Types for Infinitary Real-Valued Logic: A Topological Perspective
Olivia Aubone, Eduardo Dueñez, José Iovino
1-Genericity Is Not Weihrauch Reducible to the Finite Intersection Principle
Patrizio Cintioli