This non-implication, Form 374-n \( \not \Rightarrow \) Form 109, 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: 1247, whose string of implications is:
    60 \(\Rightarrow\) 10 \(\Rightarrow\) 423 \(\Rightarrow\) 374-n
  • A proven non-implication whose code is 3. In this case, it's Code 3: 1227, Form 60 \( \not \Rightarrow \) Form 289 whose summary information is:
    Hypothesis Statement
    Form 60 <p> \(C(\infty,WO)\): Every set of non-empty, well orderable sets has a choice function.<br /> <a href="/books/2">Moore, G. [1982]</a>, p 125. </p>

    Conclusion Statement
    Form 289 <p> If \(S\) is a set of subsets of a countable set and \(S\) is closed under chain unions, then \(S\) has a \(\subseteq\)-maximal element. </p>

  • An (optional) implication of code 1 or code 2 is given. In this case, it's Code 2: 6016, whose string of implications is:
    109 \(\Rightarrow\) 66 \(\Rightarrow\) 67 \(\Rightarrow\) 89 \(\Rightarrow\) 90 \(\Rightarrow\) 91 \(\Rightarrow\) 79 \(\Rightarrow\) 289

The conclusion Form 374-n \( \not \Rightarrow \) Form 109 then follows.

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

Name Statement
\(\cal M1\) Cohen's original model Add a denumerable number of generic reals (subsets of \(\omega\)), \(a_1\), \(a_2\), \(\cdots\), along with the set \(b\) containing them

Edit | Back