如何赢得一些简单的迭代游戏
How to win some simple iteration games
摘要：
我们引入了两个新的迭代博弈：博弈G，它是弱迭代博弈的加强，以及博弈G+，它比G稍强但比长度为ω_1的完全迭代博弈弱。对于一个可数M可初等嵌入某些V_{eta}，我们可以证明II赢得G（M，omega_1），而I不赢得G+（M）。
英文摘要：
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).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
