Implications

This non-implication, Form 10 \( \not \Rightarrow \) Form 1, 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: 10084, whose string of implications is:
    60 \(\Rightarrow\) 10
  • A proven non-implication whose code is 5. In this case, it's Code 3: 120, Form 60 \( \not \Rightarrow \) Form 97 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 97 <p> <strong>Cardinal Representatives:</strong> For every set \(A\) there is a function \(c\) with domain \({\cal P}(A)\) such that for all \(x, y\in {\cal P}(A)\), (i) \(c(x) = c(y) \leftrightarrow x\approx y\) and (ii) \(c(x)\approx x\).  <a href="/books/8">Jech [1973b]</a> p 154. </p>

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

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