Timeline for Proving results about complete Boolean algebras in ZFC using Boolean valued models
Current License: CC BY-SA 3.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
May 13, 2015 at 1:32 | vote | accept | Joseph Van Name | ||
Feb 14, 2015 at 20:22 | answer | added | Ideals | timeline score: 4 | |
Feb 14, 2015 at 3:56 | answer | added | Mohammad Golshani | timeline score: 6 | |
Feb 14, 2015 at 3:41 | comment | added | Joseph Van Name | Joel David Hamkins. I clarified that I want to know about combinatorial results on complete Boolean algebras. | |
Feb 14, 2015 at 3:40 | history | edited | Joseph Van Name | CC BY-SA 3.0 |
added 226 characters in body
|
Feb 14, 2015 at 3:23 | comment | added | Joel David Hamkins | Don't all the ZFC theorems proved via forcing fit your Boolean-valued model paradigm? If not, could you clarify why not and what you want exactly? | |
Feb 14, 2015 at 3:10 | history | asked | Joseph Van Name | CC BY-SA 3.0 |