This non-implication, Form 375 \( \not \Rightarrow \) Form 332, 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)

  • An (optional) implication of code 1 or code 2 is given. In this case, it's Code 2: 3402, whose string of implications is:
    202 \(\Rightarrow\) 40 \(\Rightarrow\) 43 \(\Rightarrow\) 375
  • A proven non-implication whose code is 5. In this case, it's Code 3: 530, Form 202 \( \not \Rightarrow \) Form 88 whose summary information is:
    Hypothesis Statement
    Form 202 <p> \(C(LO,\infty)\): Every linearly ordered family of non-empty sets has  a choice function. </p>

    Conclusion Statement
    Form 88 <p>  \(C(\infty ,2)\):  Every family of pairs has a choice function. </p>

  • An (optional) implication of code 1 or code 2 is given. In this case, it's Code 2: 9156, whose string of implications is:
    332 \(\Rightarrow\) 343 \(\Rightarrow\) 62 \(\Rightarrow\) 61 \(\Rightarrow\) 88

The conclusion Form 375 \( \not \Rightarrow \) Form 332 then follows.

Finally, the
List of models where hypothesis is true and the conclusion is false:

Name Statement
\(\cal N12(\aleph_1)\) A variation of Fraenkel's model, \(\cal N1\) Thecardinality of \(A\) is \(\aleph_1\), \(\cal G\) is the group of allpermutations on \(A\), and \(S\) is the set of all countable subsets of \(A\).In \(\cal N12(\aleph_1)\), every Dedekind finite set is finite (9 is true),but the \(2m=m\) principle (3) is false

Edit | Back