Timeline for How short can we state the Axiom of Choice?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 17, 2014 at 23:11 | comment | added | Frode Alfson Bjørdal | @François What you give is a formalization of what Russell and others used to call the multiplicative axiom, and it fits my bill but I hoped it should be possible to express something even more concise. | |
| Aug 17, 2014 at 21:21 | comment | added | Andreas Blass | If $\iff$ counts as a logical symbol, then you can say "nonempty pairwise disjoint sets" faster by saying that two of the sets have a common member if and only if they are equal. | |
| Aug 17, 2014 at 21:18 | history | answered | François G. Dorais | CC BY-SA 3.0 |