Timeline for Proof of a soft version of Moschovakis's lemma
Current License: CC BY-SA 3.0
13 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
S Jun 25, 2015 at 20:13 | history | bounty ended | Wojowu | ||
S Jun 25, 2015 at 20:13 | history | notice removed | Wojowu | ||
Jun 25, 2015 at 5:47 | vote | accept | Wojowu | ||
Jun 24, 2015 at 21:25 | answer | added | Andrés E. Caicedo | timeline score: 4 | |
Jun 24, 2015 at 20:14 | comment | added | Wojowu | @AndresCaicedo If you wish to get a bounty for this question, now is your last chance, because bounty is ending. | |
Jun 18, 2015 at 13:00 | comment | added | Wojowu | @AndresCaicedo I feel dumb for not doing this myself before, but I have just now checked that Kanamori's book indeed has the proof I was thinking about. Feel free to post this as the answer, and I'll award you the bounty. | |
Jun 17, 2015 at 20:40 | comment | added | Joel David Hamkins | The proof is basically like you say, except that it is also combined with an induction of surjections onto $P(\beta)$ for $\beta<\alpha$. You play a game where player I tries to play a real coding an initial segment of the image of $X$ (using the earlier surjections), and player II tries to play a longer initial segment. It is then not difficult to show that if $X\neq Y$ then no winning strategy in $G(X)$ is winning in $G(Y)$. | |
S Jun 17, 2015 at 20:25 | history | bounty started | Wojowu | ||
S Jun 17, 2015 at 20:25 | history | notice added | Wojowu | Draw attention | |
Jun 15, 2015 at 5:58 | comment | added | Wojowu | @AndresCaicedo Can you confirm that Kanamori's book has the proof I am talking about? Note that I am looking for a specific proof of the fact. | |
Jun 14, 2015 at 21:28 | comment | added | Andrés E. Caicedo | This is Theorem 28.15 in Kanamori's book. | |
Jun 14, 2015 at 17:38 | history | asked | Wojowu | CC BY-SA 3.0 |