Timeline for Countable Product of Class Forcing Notions
Current License: CC BY-SA 3.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Oct 31, 2013 at 5:08 | comment | added | Mohammad Golshani | Your answer is really interesting. | |
Oct 30, 2013 at 18:55 | comment | added | Joel David Hamkins | I have edited . | |
Oct 30, 2013 at 18:55 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
added 410 characters in body
|
Oct 30, 2013 at 15:52 | comment | added | Joel David Hamkins | You are right; I'll edit. | |
Oct 30, 2013 at 15:48 | comment | added | Mohammad Golshani | In fact I had the idea building $\omega-$many stationary classes, the intersection of any finitely many of them stationary, but their full intersection empty, and then use club forcing to get the desired result, but I didn't know how to figure it. | |
Oct 30, 2013 at 15:45 | comment | added | Mohammad Golshani | I think your stationary sets should be fat stationary. | |
Oct 30, 2013 at 15:13 | vote | accept | CommunityBot | ||
Oct 30, 2013 at 13:52 | history | answered | Joel David Hamkins | CC BY-SA 3.0 |