This non-implication, Form 189 \( \not \Rightarrow \) Form 336-n, 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: 9615, whose string of implications is:
    191 \(\Rightarrow\) 189
  • A proven non-implication whose code is 5. In this case, it's Code 3: 523, Form 191 \( \not \Rightarrow \) Form 390 whose summary information is:
    Hypothesis Statement
    Form 191 <p> \(SVC\): There is a set \(S\) such that for every set \(a\), there is an ordinal \(\alpha\) and a function from \(S\times\alpha\) onto \(a\). </p>

    Conclusion Statement
    Form 390 <p> Every infinite set can be partitioned either into two infinite sets or infinitely many sets, each of which has at least two elements. <a href="/excerpts/Ash-1981-1">Ash [1983]</a>. </p>

  • An (optional) implication of code 1 or code 2 is given. In this case, it's Code 2: 4866, whose string of implications is:
    336-n \(\Rightarrow\) 64 \(\Rightarrow\) 390

The conclusion Form 189 \( \not \Rightarrow \) Form 336-n 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