Hypothesis: HR 40:
\(C(WO,\infty)\): Every well orderable set of non-empty sets has a choice function. Moore, G. [1982], p 325.
Conclusion: HR 3: \(2m = m\): For all infinite cardinals \(m\), \(2m = m\).
List of models where hypothesis is true and the conclusion is false:
| Name | Statement |
|---|---|
| \(\cal N12(\aleph_1)\) A variation of Fraenkel's model, \(\cal N1\) | Thecardinality of \(A\) is \(\aleph_1\), \(\cal G\) is the group of allpermutations on \(A\), and \(S\) is the set of all countable subsets of \(A\).In \(\cal N12(\aleph_1)\), every Dedekind finite set is finite (9 is true),but the \(2m=m\) principle (3) is false |
| \(\cal N33\) Howard/H\.Rubin/J\.Rubin Model | \(A\) is countably infinite;\(\precsim\) is a dense linear ordering on \(A\) without first or lastelements (\((A,\precsim) \cong (\Bbb Q,\le)\)); \(\cal G\) is the group of allorder automorphisms on \((A,\precsim)\); and \(S\) is the set of all boundedsubsets of \(A\) |
| \(\cal N56\) Howard's model III: Assume the the atoms are indexed asfollows: \(A = \{a(i,j) : i\in{\Bbb Q} \hbox{ and } j\in\omega \}\) | Foreach \(i\in \Bbb Q\), let \(A_i = \{a(i,j) : j\in \omega\}\) |
Code: 3
Comments: