Hypothesis: HR 30:
Ordering Principle: Every set can be linearly ordered.
Conclusion: HR 6:
\(UT(\aleph_0,\aleph_0,\aleph_0,\Bbb R)\): The union of a denumerable family of denumerable subsets of \({\Bbb R}\) is denumerable.
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\) |
Code: 3
Comments: