Implications

This non-implication, Form 211 \( \not \Rightarrow \) Form 396, 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: 10221, whose string of implications is:
    43 \(\Rightarrow\) 211
  • A proven non-implication whose code is 3. In this case, it's Code 3: 1336, Form 43 \( \not \Rightarrow \) Form 330 whose summary information is:
    Hypothesis Statement
    Form 43 <p> \(DC(\omega)\) (DC), <strong>Principle of Dependent Choices:</strong> If \(S\)  is  a relation on a non-empty set \(A\) and \((\forall x\in A) (\exists y\in A)(x S y)\)  then there is a sequence \(a(0), a(1), a(2), \ldots\) of elements of \(A\) such that \((\forall n\in\omega)(a(n)\mathrel S a(n+1))\).  See <a href="/articles/Tarski-1948">Tarski [1948]</a>, p 96, <a href="/articles/Levy-1964">Levy [1964]</a>, p. 136. </p>

    Conclusion Statement
    Form 330 <p> \(MC(WO,WO)\): For every well ordered set \(X\) of well orderable sets such that for all \(x\in X\), \(|x|\ge 1\), there is a function \(f\) such that for every \(x\in X\), \(f(x)\) is a finite, non-empty subset of \(x\).  (See <a href="/form-classes/howard-rubin-67">Form 67</a>.) </p>

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

The conclusion Form 211 \( \not \Rightarrow \) Form 396 then follows.

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

Name Statement
\(\cal N15\) Brunner/Howard Model I \(A=\{a_{i,\alpha}: i\in\omega\wedge\alpha\in\omega_1\}\)

Edit | Back