This non-implication,
Form 19 \( \not \Rightarrow \)
Form 210,
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 91 | <p> \(PW\): The power set of a well ordered set can be well ordered. </p> |
Conclusion | Statement |
---|---|
Form 210 | <p> The commutator subgroup of a free group is free. </p> |
The conclusion Form 19 \( \not \Rightarrow \) Form 210 then follows.
Finally, the
List of models where hypothesis is true and the conclusion is false:
Name | Statement |
---|---|
\(\cal N30\) Läuchli's Model III | The set \(A\) is denumerable; \(\cal G\) isthe group generated by the set of transpositions on \(A\); and \(S\) is theset of all finite subsets of \(A\) |