This non-implication,
Form 290 \( \not \Rightarrow \)
Form 86-alpha,
whose code is 4, is constructed around a proven non-implication as follows:
Hypothesis | Statement |
---|---|
Form 290 | <p> For all infinite \(x\), \(|2^x|=|x^x|\). </p> |
Conclusion | Statement |
---|---|
Form 32 | <p> \(C(\aleph_0,\le\aleph_0)\): Every denumerable set of non-empty countable sets has a choice function. </p> |
The conclusion Form 290 \( \not \Rightarrow \) Form 86-alpha then follows.
Finally, the
List of models where hypothesis is true and the conclusion is false:
Name | Statement |
---|---|
\(\cal M29\) Pincus' Model II | Pincus constructs a generic extension \(M[I]\) of a model \(M\) of \(ZF +\) class choice \(+ GCH\) in which \(I=\bigcup_{n\in\omega}I_n\), \(I_{-1}=2\) and \(I_{n+1}\) is a denumerable set of independent functions from \(\omega\) onto \(I_n\) |