This non-implication,
Form 373-n \( \not \Rightarrow \)
Form 214,
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 133 | <p> Every set is either well orderable or has an infinite amorphous subset. </p> |
| Conclusion | Statement |
|---|---|
| Form 76 | <p> \(MC_\omega(\infty,\infty)\) (\(\omega\)-MC): For every family \(X\) of pairwise disjoint non-empty sets, there is a function \(f\) such that for each \(x\in X\), f(x) is a non-empty countable subset of \(x\). </p> |
The conclusion Form 373-n \( \not \Rightarrow \) Form 214 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\) |
| \(\cal N24\) Hickman's Model I | This model is a variation of \(\cal N2\) |
| \(\cal N24(n)\) An extension of \(\cal N24\) to \(n\)-element sets, \(n>1\).\(A=\bigcup B\), where \( B=\{b_i: i\in\omega\}\) is a pairwise disjoint setof \(n\)-element sets | \(\cal G\) is the group of all permutations of \(A\)which are permutations of \(B\); and \(S\) is the set of all finite subsets of\(A\) |
| \(\cal N26\) Brunner/Pincus Model, a variation of \(\cal N2\) | The set ofatoms \(A=\bigcup_{n\in\omega} P_n\), where the \(P_n\)'s are pairwisedisjoint denumerable sets; \(\cal G\) is the set of all permutations\(\sigma\) on \(A\) such that \(\sigma(P_n)=P_n\), for all \(n\in\omega\); and \(S\)is the set of all finite subsets of \(A\) |