Hypothesis: HR 31:
\(UT(\aleph_{0},\aleph_{0},\aleph_{0})\): The countable union theorem: The union of a denumerable set of denumerable sets is denumerable.
Conclusion: HR 132:
\(PC(\infty, <\aleph_0,\infty)\): Every infinite family of finite sets has an infinite subfamily with a choice function.
List of models where hypothesis is true and the conclusion is false:
| Name | Statement |
|---|---|
| \(\cal N24\) Hickman's Model I | This model is a variation of \(\cal N2\) |
Code: 3
Comments: