This non-implication,
Form 75 \( \not \Rightarrow \)
Form 239,
whose code is 4, is constructed around a proven non-implication as follows:
Hypothesis | Statement |
---|---|
Form 3 | \(2m = m\): For all infinite cardinals \(m\), \(2m = m\). |
Conclusion | Statement |
---|---|
Form 5 | <p> \(C(\aleph_0,\aleph_0,\Bbb R)\): Every denumerable set of non-empty denumerable subsets of \({\Bbb R}\) has a choice function. </p> |
The conclusion Form 75 \( \not \Rightarrow \) Form 239 then follows.
Finally, the
List of models where hypothesis is true and the conclusion is false:
Name | Statement |
---|---|
\(\cal M6\) Sageev's Model I | Using iterated forcing, Sageev constructs \(\cal M6\) by adding a denumerable number of generic tree-like structuresto the ground model, a model of \(ZF + V = L\) |