Timeline for Does every set admit a rigid binary relation? (and how is this related to the Axiom of Choice?)
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 19, 2011 at 20:21 | comment | added | Goldstern | A more established terminology: In "The structure of amorphous sets" (APAL 1995, MR1332569), Truss calls an amorphous set "STRICTLY AMORPHOUS" if every partition into finite classes must have almost all classes of size 1, and I think he proves (as one of the easy cases, actually) that this is the same as what I called "strongly amorphous" here. | |
| Jul 19, 2011 at 12:44 | history | answered | Goldstern | CC BY-SA 3.0 |