We have the following indirect implication of form equivalence classes:
Implication | Reference |
---|---|
100 \(\Rightarrow\) 347 |
Partition principles and infinite sums of cardinal numbers, Higasikawa, M. 1995, Notre Dame J. Formal Logic |
347 \(\Rightarrow\) 40 |
Partition principles and infinite sums of cardinal numbers, Higasikawa, M. 1995, Notre Dame J. Formal Logic |
40 \(\Rightarrow\) 39 | clear |
39 \(\Rightarrow\) 8 | clear |
8 \(\Rightarrow\) 24 | clear |
24 \(\Rightarrow\) 26 | Zermelo's Axiom of Choice, Moore, 1982, 66 Le¸cons sur la th´eorie des fonctions, Borel, [1898] |
26 \(\Rightarrow\) 209 | note-72 |
Here are the links and statements of the form equivalence classes referenced above:
Howard-Rubin Number | Statement |
---|---|
100: | Weak Partition Principle: For all sets \(x\) and \(y\), if \(x\precsim^* y\), then it is not the case that \(y\prec x\). |
347: | Idemmultiple Partition Principle: If \(y\) is idemmultiple (\(2\times y\approx y\)) and \(x\precsim ^* y\), then \(x\precsim y\). |
40: | \(C(WO,\infty)\): Every well orderable set of non-empty sets has a choice function. Moore, G. [1982], p 325. |
39: | \(C(\aleph_{1},\infty)\): Every set \(A\) of non-empty sets such that \(\vert A\vert = \aleph_{1}\) has a choice function. Moore, G. [1982], p. 202. |
8: | \(C(\aleph_{0},\infty)\): |
24: | \(C(\aleph_0,2^{(2^{\aleph_0})})\): Every denumerable collection of non-empty sets each with power \(2^{(2^{\aleph_{0}})}\) has a choice function. |
26: | \(UT(\aleph_{0},2^{\aleph_{0}},2^{\aleph_{0}})\): The union of denumerably many sets each of power \(2^{\aleph _{0}}\) has power \(2^{\aleph_{0}}\). |
209: | There is an ordinal \(\alpha\) such that for all \(X\), if \(X\) is a denumerable union of denumerable sets then \({\cal P}(X)\) cannot be partitioned into \(\aleph_{\alpha}\) non-empty sets. |
Comment: