Implications

This non-implication, Form 31 \( \not \Rightarrow \) Form 200, 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: 1708, whose string of implications is:
    16 \(\Rightarrow\) 352 \(\Rightarrow\) 31
  • A proven non-implication whose code is 5. In this case, it's Code 3: 24, Form 16 \( \not \Rightarrow \) Form 200 whose summary information is:
    Hypothesis Statement
    Form 16 <p> \(C(\aleph_{0},\le 2^{\aleph_{0}})\):  Every denumerable collection of non-empty sets  each with power \(\le  2^{\aleph_{0}}\) has a choice function. </p>

    Conclusion Statement
    Form 200 <p> For all infinite \(x\), \(|2^{x}| = |x!|\). </p>

  • This non-implication was constructed without the use of this last code 2/1 implication

The conclusion Form 31 \( \not \Rightarrow \) Form 200 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\)
\(\cal N3\) Mostowski's Linearly Ordered Model \(A\) is countably infinite;\(\precsim\) is a dense linear ordering on \(A\) without first or lastelements (\((A,\precsim) \cong (\Bbb Q,\le)\)); \(\cal G\) is the group of allorder automorphisms on \((A,\precsim)\); and \(S\) is the set of all finitesubsets of \(A\)
\(\cal N29\) Dawson/Howard Model Let \(A=\bigcup\{B_n; n\in\omega\}\) is a disjoint union, where each \(B_n\) is denumerable and ordered like the rationals by \(\le_n\)

Edit | Back