Implications

This non-implication, Form 170 \( \not \Rightarrow \) Form 47-n, 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: 6906, whose string of implications is:
    337 \(\Rightarrow\) 92 \(\Rightarrow\) 170
  • A proven non-implication whose code is 5. In this case, it's Code 3: 696, Form 337 \( \not \Rightarrow \) Form 288-n whose summary information is:
    Hypothesis Statement
    Form 337 <p> \(C(WO\), <strong>uniformly linearly ordered</strong>):  If \(X\) is a well ordered collection of non-empty sets and there is a function \(f\) defined on \(X\) such that for every \(x\in X\), \(f(x)\) is a linear ordering of \(x\), then there is a choice function for \(X\). </p>

    Conclusion Statement
    Form 288-n <p> If \(n\in\omega-\{0,1\}\), \(C(\aleph_0,n)\): Every denumerable 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: 10066, whose string of implications is:
    47-n \(\Rightarrow\) 288-n

The conclusion Form 170 \( \not \Rightarrow \) Form 47-n then follows.

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

Name Statement
\(\cal N2(n)\) A generalization of \(\cal N2\) This is a generalization of\(\cal N2\) in which there is a denumerable set of \(n\) element sets for\(n\in\omega - \{0,1\}\)
\(\cal N2^*(3)\) Howard's variation of \(\cal N2(3)\) \(A=\bigcup B\), where\(B\) is a set of pairwise disjoint 3 element sets, \(T_i = \{a_i, b_i,c_i\}\)

Edit | Back