Timeline for Veličković's model game
Current License: CC BY-SA 4.0
4 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 10, 2022 at 8:41 | comment | added | Monroe Eskew | Thanks. I was about to post a way to get around my question. Just run the argument with the sequence $\{ \sigma_\alpha : \alpha < \omega_1 \}$ in the model $N_0$. Then find the countable $z$ with $z \cap \omega_1 = \alpha \in A_F$. Noting that $\sigma_\alpha \in N_{\xi_n}$ for each $n$, we construt a run of $\sigma_\alpha$ in which Player I wins. | |
Mar 10, 2022 at 8:36 | vote | accept | Monroe Eskew | ||
Mar 10, 2022 at 8:29 | history | edited | Sean Cox | CC BY-SA 4.0 |
added 213 characters in body
|
Mar 10, 2022 at 8:07 | history | answered | Sean Cox | CC BY-SA 4.0 |