This non-implication,
Form 74 \( \not \Rightarrow \)
Form 373-n,
whose code is 6,
is constructed around a proven non-implication as follows:
Note: This non-implication is actually a code 4, as this non-implication satisfies the
transferability criterion. Click
Transfer details for all the details)
Hypothesis | Statement |
---|---|
Form 337 | <p> \(C(WO\), <strong>uniformly linearly ordered</strong>): If \(X\) is a well ordered collection of non-empty sets and there is a function \(f\) defined on \(X\) such that for every \(x\in X\), \(f(x)\) is a linear ordering of \(x\), then there is a choice function for \(X\). </p> |
Conclusion | Statement |
---|---|
Form 373-n | <p> (For \(n\in\omega\), \(n\ge 2\).) \(PC(\aleph_0,n,\infty)\): Every denumerable set of \(n\)-element sets has an infinite subset with a choice function. </p> |
The conclusion Form 74 \( \not \Rightarrow \) Form 373-n then follows.
Finally, the
List of models where hypothesis is true and the conclusion is false:
Name | Statement |
---|---|
\(\cal N2(n)\) A generalization of \(\cal N2\) | This is a generalization of\(\cal N2\) in which there is a denumerable set of \(n\) element sets for\(n\in\omega - \{0,1\}\) |