Timeline for Can iterating countable unions give every set? (ZF)
Current License: CC BY-SA 2.5
11 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jul 27, 2010 at 0:19 | vote | accept | CommunityBot | ||
Jul 27, 2010 at 0:19 | vote | accept | CommunityBot | ||
Jul 27, 2010 at 0:19 | |||||
Jul 23, 2010 at 11:44 | answer | added | Joel David Hamkins | timeline score: 2 | |
Jul 23, 2010 at 1:05 | history | edited | François G. Dorais |
edited tags
|
|
Jul 23, 2010 at 0:59 | comment | added | Rachid Atmai | I deleted my answer since I completely misunderstood the question. | |
Jul 23, 2010 at 0:54 | answer | added | François G. Dorais | timeline score: 9 | |
Jul 23, 2010 at 0:42 | comment | added | François G. Dorais | OK, I had missed "iterated" in the title. I meant to say uncountable regular cardinal in my second comment. | |
Jul 23, 2010 at 0:37 | comment | added | user5810 | By "closure", I mean the minimal superset closed under it. I already know ZF proves Aleph_0 is regular. | |
Jul 23, 2010 at 0:32 | comment | added | François G. Dorais | Are you wondering if ZF proves the existence of a regular cardinal? | |
Jul 23, 2010 at 0:29 | comment | added | François G. Dorais | Can you explain what you mean by "closure"? Under my interpretation, any uncountable set will do. | |
Jul 23, 2010 at 0:04 | history | asked | user5810 | CC BY-SA 2.5 |