This non-implication, Form 190 \( \not \Rightarrow \) Form 171, whose code is 6, 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: 7695, whose string of implications is:
    191 \(\Rightarrow\) 189 \(\Rightarrow\) 190
  • A proven non-implication whose code is 5. In this case, it's Code 3: 486, Form 191 \( \not \Rightarrow \) Form 171 whose summary information is:
    Hypothesis Statement
    Form 191 <p> \(SVC\): There is a set \(S\) such that for every set \(a\), there is an ordinal \(\alpha\) and a function from \(S\times\alpha\) onto \(a\). </p>

    Conclusion Statement
    Form 171 <p> If \((P,\le)\) is a partial order such that \(P\) is the denumerable union of finite sets and all antichains in \(P\) are finite then for each denumerable family \({\cal D}\) of dense sets there is a \({\cal D}\) generic filter. </p>

  • This non-implication was constructed without the use of this last code 2/1 implication

The conclusion Form 190 \( \not \Rightarrow \) Form 171 then follows.

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

Name Statement
\(\cal N6\) Levy's Model I \(A=\{a_n : n\in\omega\}\) and \(A = \bigcup \{P_n: n\in\omega\}\), where \(P_0 = \{a_0\}\), \(P_1 = \{a_1,a_2\}\), \(P_2 =\{a_3,a_4,a_5\}\), \(P_3 = \{a_6,a_7,a_8,a_9,a_{10}\}\), \(\cdots\); in generalfor \(n>0\), \(|P_n| = p_n\), where \(p_n\) is the \(n\)th prime

Edit | Back