Implications

This non-implication, Form 250 \( \not \Rightarrow \) Form 349, 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: 7509, whose string of implications is:
    23 \(\Rightarrow\) 151 \(\Rightarrow\) 122 \(\Rightarrow\) 250
  • A proven non-implication whose code is 5. In this case, it's Code 3: 72, Form 23 \( \not \Rightarrow \) Form 349 whose summary information is:
    Hypothesis Statement
    Form 23 <p> \((\forall \alpha)(UT(\aleph_{\alpha},\aleph_{\alpha}, \aleph_{\alpha}))\): For every ordinal \(\alpha\), if \(A\) and every member of \(A\) has cardinality \(\aleph_{\alpha}\), then \(|\bigcup A| = \aleph _{\alpha }\). </p>

    Conclusion Statement
    Form 349 <p> \(MC(\infty,\aleph_0)\): For every set \(X\) of non-empty denumerable sets there is a function \(f\) such that for all \(x\in X\), \(f(x)\) is a finite, non-empty subset of \(x\). </p>

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

The conclusion Form 250 \( \not \Rightarrow \) Form 349 then follows.

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

Name Statement
\(\cal N33\) Howard/H\.Rubin/J\.Rubin 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 boundedsubsets of \(A\)

Edit | Back