This non-implication,
Form 316 \( \not \Rightarrow \)
Form 168,
whose code is 6,
is constructed around a proven non-implication as follows:
Hypothesis | Statement |
---|---|
Form 112 | <p> \(MC(\infty,LO)\): For every family \(X\) of non-empty sets each of which can be linearly ordered there is a function \(f\) such that for all \(y\in X\), \(f(y)\) is a non-empty finite subset of \(y\). </p> |
Conclusion | Statement |
---|---|
Form 126 | <p> \(MC(\aleph_0,\infty)\), <strong>Countable axiom of multiple choice:</strong> For every denumerable set \(X\) of non-empty sets there is a function \(f\) such that for all \(y\in X\), \(f(y)\) is a non-empty finite subset of \(y\). </p> |
The conclusion Form 316 \( \not \Rightarrow \) Form 168 then follows.
Finally, the
List of models where hypothesis is true and the conclusion is false:
Name | Statement |
---|---|
\(\cal N1\) The Basic Fraenkel Model | The set of atoms, \(A\) is denumerable; \(\cal G\) is the group of all permutations on \(A\); and \(S\) isthe set of all finite subsets of \(A\) |