This non-implication, Form 27 \( \not \Rightarrow \) Form 36, 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: 359, whose string of implications is:
    43 \(\Rightarrow\) 8 \(\Rightarrow\) 27
  • A proven non-implication whose code is 3. In this case, it's Code 3: 885, Form 43 \( \not \Rightarrow \) Form 46-K 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 46-K <p> If \(K\) is a finite subset of \(\omega-\{0,1\}\), \(C(\infty,K)\): For every \(n\in K\), every set of \(n\)-element sets has a choice function. </p>

  • An (optional) implication of code 1 or code 2 is given. In this case, it's Code 2: 4287, whose string of implications is:
    36 \(\Rightarrow\) 62 \(\Rightarrow\) 61 \(\Rightarrow\) 46-K

The conclusion Form 27 \( \not \Rightarrow \) Form 36 then follows.

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

Name Statement
\(\cal M47(n,M)\) Pincus' Model IX This is the model of <a href="/articles/Pincus-1977a">Pincus [1977a]</a>, Theorem 2.1 \((E)\)

Edit | Back