This non-implication, Form 323 \( \not \Rightarrow \) Form 290, whose code is 4, 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: 9964, whose string of implications is:
    60 \(\Rightarrow\) 323
  • A proven non-implication whose code is 3. In this case, it's Code 3: 1237, Form 60 \( \not \Rightarrow \) Form 290 whose summary information is:
    Hypothesis Statement
    Form 60 <p> \(C(\infty,WO)\): Every set of non-empty, well orderable sets has a choice function.<br /> <a href="/books/2">Moore, G. [1982]</a>, p 125. </p>

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

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

The conclusion Form 323 \( \not \Rightarrow \) Form 290 then follows.

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

Name Statement
\(\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\)

Edit | Back