We have the following indirect implication of form equivalence classes:
Implication | Reference |
---|---|
101 \(\Rightarrow\) 40 |
On some weak forms of the axiom of choice in set theory, Pelc, A. 1978, Bull. Acad. Polon. Sci. S'er. Sci. Math. Astronom. Phys. |
40 \(\Rightarrow\) 39 | clear |
39 \(\Rightarrow\) 8 | clear |
8 \(\Rightarrow\) 27 | clear |
27 \(\Rightarrow\) 31 | clear |
31 \(\Rightarrow\) 32 |
L’axiome de M. Zermelo et son rˆole dans la th´eorie des ensembles et l’analyse, Sierpi'nski, W. 1918, Bull. Int. Acad. Sci. Cracovie Cl. Math. Nat. |
32 \(\Rightarrow\) 119 | clear |
Here are the links and statements of the form equivalence classes referenced above:
Howard-Rubin Number | Statement |
---|---|
101: | Partition Principle: If \(S\) is a partition of \(M\), then \(S \precsim M\). |
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)\): |
27: | \((\forall \alpha)( UT(\aleph_{0},\aleph_{\alpha}, \aleph_{\alpha}))\): The union of denumerably many sets each of power \(\aleph_{\alpha }\) has power \(\aleph_{\alpha}\). Moore, G. [1982], p 36. |
31: | \(UT(\aleph_{0},\aleph_{0},\aleph_{0})\): The countable union theorem: The union of a denumerable set of denumerable sets is denumerable. |
32: | \(C(\aleph_0,\le\aleph_0)\): Every denumerable set of non-empty countable sets has a choice function. |
119: | van Douwen's choice principle: \(C(\aleph_{0}\),uniformly orderable with order type of the integers): Suppose \(\{ A_{i}: i\in\omega\}\) is a set and there is a function \(f\) such that for each \(i\in\omega,\ f(i)\) is an ordering of \(A_{i}\) of type \(\omega^{*}+\omega\) (the usual ordering of the integers), then \(\{A_{i}: i\in\omega\}\) has a choice function. |
Comment: