Timeline for Transfer with minimal choice
Current License: CC BY-SA 3.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 15, 2016 at 6:50 | history | edited | Mikhail Katz | CC BY-SA 3.0 |
added 148 characters in body
|
Jun 14, 2016 at 22:40 | review | Close votes | |||
Jun 15, 2016 at 20:26 | |||||
Jun 14, 2016 at 16:42 | history | edited | Asaf Karagila♦ |
edited tags
|
|
Jun 14, 2016 at 16:35 | answer | added | Asaf Karagila♦ | timeline score: 3 | |
Jun 14, 2016 at 16:20 | history | edited | Mikhail Katz | CC BY-SA 3.0 |
edited title
|
Jun 14, 2016 at 16:01 | history | edited | YCor |
edited tags
|
|
Jun 14, 2016 at 15:50 | history | edited | Mikhail Katz |
edited tags
|
|
Jun 14, 2016 at 15:47 | comment | added | Mikhail Katz | Thanks. Is this mentioned explicitly in the literature? @EmilJeřábek | |
Jun 14, 2016 at 13:59 | comment | added | Emil Jeřábek | You mean the transfer principle for the diagonal embedding of the universe in its ultrapower over a free ultrafilter on $\mathbb N$? Then yes, countable choice is enough to prove Łoś’s theorem for ultraproducts over countable index sets. | |
Jun 14, 2016 at 12:52 | history | asked | Mikhail Katz | CC BY-SA 3.0 |