This non-implication,
Form 216 \( \not \Rightarrow \)
Form 1,
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)
Hypothesis | Statement |
---|---|
Form 217 | <p> Every infinite partially ordered set has either an infinite chain or an infinite antichain. </p> |
Conclusion | Statement |
---|---|
Form 267 | <p> There is no infinite, free complete Boolean algebra. </p> |
The conclusion Form 216 \( \not \Rightarrow \) Form 1 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\) |