This non-implication, Form 70 \( \not \Rightarrow \) Form 396, 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: 10299, whose string of implications is:
    63 \(\Rightarrow\) 70
  • A proven non-implication whose code is 5. In this case, it's Code 3: 133, Form 63 \( \not \Rightarrow \) Form 350 whose summary information is:
    Hypothesis Statement
    Form 63 <p> \(SPI\): Weak ultrafilter principle: Every infinite set has a non-trivial ultrafilter. <br /> <a href="/books/8">Jech [1973b]</a>, p 172 prob 8.5. </p>

    Conclusion Statement
    Form 350 <p> \(MC(\aleph_0,\aleph_0)\): For every denumerable 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>

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

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

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

Name Statement
\(\cal N41\) Another variation of \(\cal N3\) \(A=\bigcup\{B_n; n\in\omega\}\)is a disjoint union, where each \(B_n\) is denumerable and ordered like therationals by \(\le_n\)

Edit | Back