Implications

This non-implication, Form 250 \( \not \Rightarrow \) Form 303, 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: 3468, whose string of implications is:
    202 \(\Rightarrow\) 40 \(\Rightarrow\) 122 \(\Rightarrow\) 250
  • A proven non-implication whose code is 5. In this case, it's Code 3: 528, Form 202 \( \not \Rightarrow \) Form 45-n 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 45-n <p> If \(n\in\omega-\{0,1\}\), \(C(\infty,n)\): Every set of \(n\)-element sets has a choice function. </p>

  • An (optional) implication of code 1 or code 2 is given. In this case, it's Code 2: 4132, whose string of implications is:
    303 \(\Rightarrow\) 50 \(\Rightarrow\) 14 \(\Rightarrow\) 49 \(\Rightarrow\) 30 \(\Rightarrow\) 62 \(\Rightarrow\) 61 \(\Rightarrow\) 45-n

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