We have the following indirect implication of form equivalence classes:
Implication | Reference |
---|---|
23 \(\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\) 10 | clear |
10 \(\Rightarrow\) 216 |
Here are the links and statements of the form equivalence classes referenced above:
Howard-Rubin Number | Statement |
---|---|
23: | \((\forall \alpha)(UT(\aleph_{\alpha},\aleph_{\alpha}, \aleph_{\alpha}))\): For every ordinal \(\alpha\), if \(A\) and every member of \(A\) has cardinality \(\aleph_{\alpha}\), then \(|\bigcup A| = \aleph _{\alpha }\). |
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. |
10: | \(C(\aleph_{0},< \aleph_{0})\): Every denumerable family of non-empty finite sets has a choice function. |
216: | Every infinite tree has either an infinite chain or an infinite antichain. |
Comment: