Timeline for Set forcing over transitive models of NBG
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 9, 2018 at 23:56 | comment | added | Not Mike | Those references are fascinating, thanks | |
| Jan 9, 2018 at 21:10 | comment | added | Joel David Hamkins | Nice answer. I believe that the mixing lemma for class names for set forcing will be equivalent to the <Ord-CC class collection principle (also known as class choice). Indeed, I think we will get $\kappa$-CC from class mixing for the forcing which is a $\kappa$-sized lottery sum of trivial forcing. | |
| Jan 9, 2018 at 20:40 | vote | accept | Stefan Mesken | ||
| Jan 9, 2018 at 20:40 | comment | added | Stefan Mesken | Thank you, Victoria. That's precisely what I was looking for. | |
| Jan 9, 2018 at 20:16 | history | edited | Victoria Gitman | CC BY-SA 3.0 |
added 407 characters in body
|
| Jan 9, 2018 at 19:44 | history | edited | Victoria Gitman | CC BY-SA 3.0 |
added 407 characters in body
|
| Jan 9, 2018 at 19:35 | history | answered | Victoria Gitman | CC BY-SA 3.0 |