How to win some simple iteration games

DOI10.1016/S0168-0072(96)00013-9zbMATH Open0896.03043arXivmath/9310212MaRDI QIDQ5961723FDOQ5961723

John Steel, Alessandro Andretta

Publication date: 1 October 1998

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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).

Full work available at URL: https://arxiv.org/abs/math/9310212

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

zbMATH Keywords

inner modelsiteration treesiteration gamenon-tame mice

Mathematics Subject Classification ID

Large cardinals (03E55) Inner models, including constructibility, ordinal definability, and core models (03E45)

Cites Work

• Inner models with many Woodin cardinals
• Iteration Trees
• Title not available (Why is that?)
• A Proof of Projective Determinacy
• Title not available (Why is that?)
• The well-foundedness of the Mitchell order

Cited In (5)

• How to win a game with features
• Strong cardinals in the core model
• A weak Dodd-Jensen lemma
• Title not available (Why is that?)
• How to Win at Tenzi

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)