This non-implication,
Form 249 \( \not \Rightarrow \)
Form 421,
whose code is 4, is constructed around a proven non-implication as follows:
Hypothesis | Statement |
---|---|
Form 32 | <p> \(C(\aleph_0,\le\aleph_0)\): Every denumerable set of non-empty countable sets has a choice function. </p> |
Conclusion | Statement |
---|---|
Form 338 | <p> \(UT(\aleph_0,\aleph_0,WO)\): The union of a denumerable number of denumerable sets is well orderable. </p> |
The conclusion Form 249 \( \not \Rightarrow \) Form 421 then follows.
Finally, the
List of models where hypothesis is true and the conclusion is false:
Name | Statement |
---|