Timeline for Explicit ordering on set with larger cardinality than R
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 3, 2010 at 3:52 | answer | added | Andrés E. Caicedo | timeline score: 15 | |
| Jun 3, 2010 at 1:09 | comment | added | Gerald Edgar | For lexicographic, the exponent should be well-ordered (or maybe reverse well-ordered). With the usual ordering on the exponent R, you can have two members of R^R but no least spot where they disagree. | |
| Jun 2, 2010 at 22:23 | comment | added | Qiaochu Yuan | Lexicographic order on R^R? | |
| Jun 2, 2010 at 21:02 | answer | added | François G. Dorais | timeline score: 4 | |
| Jun 2, 2010 at 20:56 | answer | added | Michael Greinecker | timeline score: 2 | |
| Jun 2, 2010 at 20:51 | vote | accept | Sune Jakobsen | ||
| Jun 2, 2010 at 20:45 | answer | added | Joel David Hamkins | timeline score: 21 | |
| Jun 2, 2010 at 20:40 | history | asked | Sune Jakobsen | CC BY-SA 2.5 |