This non-implication, Form 305 \( \not \Rightarrow \) Form 2, 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: 6891, whose string of implications is:
    202 \(\Rightarrow\) 91 \(\Rightarrow\) 305
  • A proven non-implication whose code is 5. In this case, it's Code 3: 526, Form 202 \( \not \Rightarrow \) Form 3 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 3  \(2m = m\): For all infinite cardinals \(m\), \(2m = m\).

  • An (optional) implication of code 1 or code 2 is given. In this case, it's Code 2: 9882, whose string of implications is:
    2 \(\Rightarrow\) 3

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