Timeline for Given a cardinal k, what's the biggest dense linear order with a dense subset of size k?
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 19, 2014 at 16:18 | answer | added | Ioannis Souldatos | timeline score: 8 | |
| Dec 7, 2010 at 0:40 | vote | accept | Amit Kumar Gupta | ||
| Dec 5, 2010 at 0:34 | answer | added | Andreas Blass | timeline score: 11 | |
| Dec 4, 2010 at 10:03 | comment | added | Amit Kumar Gupta | Thomas Scanlon recalled reading about it in someone's PhD thesis here at Berkeley. It should have occurred to me sooner, the second formulation of the question is just another way of saying that a DLO can be associated with its set of Dedekind cuts, that's why it makes sense to call them 'Dedekind numbers.' | |
| Dec 4, 2010 at 3:26 | comment | added | Ed Dean |
Out of curiosity, what's the source of the belief that "Apparently the answer's supposed to be yes,' and the relevant notion is that of a Dedekind number,'" ?
|
|
| Dec 3, 2010 at 23:19 | history | asked | Amit Kumar Gupta | CC BY-SA 2.5 |