How to win some simple iteration games
| dc.creator | Andretta, Alessandro | |
| dc.creator | Steel, John R. | |
| dc.date | 1993-10-09 | |
| dc.date.accessioned | 2026-07-07T09:14:58Z | |
| dc.date.available | 2026-07-07T09:14:58Z | |
| dc.description | 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). | |
| dc.identifier | https://arxiv.org/abs/math/9310212 | |
| dc.identifier | http://arxiv.org/abs/math/9310212 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/152871 | |
| dc.subject | Logic | |
| dc.title | How to win some simple iteration games | |
| dc.type | text |