Timeline for Are there better arithmetics on ordinals?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 9, 2013 at 19:55 | history | edited | John Baez | CC BY-SA 3.0 |
fixed typos
|
| Aug 7, 2013 at 4:09 | history | edited | user36136 | CC BY-SA 3.0 |
edited title
|
| Aug 7, 2013 at 3:50 | history | edited | user36136 | CC BY-SA 3.0 |
added 140 characters in body
|
| Jul 22, 2013 at 15:31 | answer | added | Noah Schweber | timeline score: 8 | |
| Jul 22, 2013 at 15:16 | answer | added | Andreas Blass | timeline score: 5 | |
| Jul 22, 2013 at 15:02 | comment | added | Joel David Hamkins | And how could it be unique? Any permutation of the infinite ordinals would provide another way of imposing the structure. | |
| Jul 22, 2013 at 15:00 | comment | added | Joel David Hamkins | Isn't question (1) answered by the Lowenheim-Skolem theorem? (One would want a proper class version of LS, which is provable using global choice.) | |
| Jul 22, 2013 at 14:54 | history | asked | user36136 | CC BY-SA 3.0 |