Timeline for Compactness of the Hilbert cube without the Axiom of Choice
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 19, 2020 at 16:34 | comment | added | Taras Banakh | On the other hand, for any ordinal $\alpha$ the compactness of the Tychonoff cube $[0,1]^\alpha$ can be proved without AC or BPIT, usinng the completeness of the lexicographic order on $[0,1]^\alpha$ (or even on $\{0,1\}^\alpha$). | |
| Jan 20, 2013 at 2:09 | vote | accept | Alexey Muranov | ||
| Dec 13, 2014 at 15:01 | |||||
| Jan 19, 2013 at 21:54 | history | answered | Asaf Karagila♦ | CC BY-SA 3.0 |