This non-implication, Form 58 \( \not \Rightarrow \) Form 257, whose code is 6, is constructed around a proven non-implication as follows:

  • An (optional) implication of code 1 or code 2 is given. In this case, it's Code 2: 6522, whose string of implications is:
    112 \(\Rightarrow\) 90 \(\Rightarrow\) 51 \(\Rightarrow\) 208 \(\Rightarrow\) 58
  • A proven non-implication whose code is 5. In this case, it's Code 3: 260, Form 112 \( \not \Rightarrow \) Form 126 whose summary information is:
    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>

  • An (optional) implication of code 1 or code 2 is given. In this case, it's Code 2: 8678, whose string of implications is:
    257 \(\Rightarrow\) 260 \(\Rightarrow\) 40 \(\Rightarrow\) 39 \(\Rightarrow\) 8 \(\Rightarrow\) 126

The conclusion Form 58 \( \not \Rightarrow \) Form 257 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\)

Edit | Back