Implications

This non-implication, Form 342-n \( \not \Rightarrow \) Form 404, 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: 5905, whose string of implications is:
    379 \(\Rightarrow\) 73 \(\Rightarrow\) 342-n
  • A proven non-implication whose code is 5. In this case, it's Code 3: 737, Form 379 \( \not \Rightarrow \) Form 390 whose summary information is:
    Hypothesis Statement
    Form 379 <p> \(PKW(\infty,\infty,\infty)\): For every infinite family \(X\) of sets each of which has at least two elements, there is an infinite subfamily \(Y\) of \(X\) and a function \(f\) such that for all \(y\in Y\), \(f(y)\) is a non-empty proper subset of \(y\). </p>

    Conclusion Statement
    Form 390 <p> Every infinite set can be partitioned either into two infinite sets or infinitely many sets, each of which has at least two elements. <a href="/excerpts/Ash-1981-1">Ash [1983]</a>. </p>

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

The conclusion Form 342-n \( \not \Rightarrow \) Form 404 then follows.

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

Name Statement
\(\cal N1\) The Basic Fraenkel Model The set of atoms, \(A\) is denumerable; \(\cal G\) is the group of all permutations on \(A\); and \(S\) isthe set of all finite subsets of \(A\)

Edit | Back