We have the following indirect implication of form equivalence classes:
| Implication | Reference |
|---|---|
| 87-alpha \(\Rightarrow\) 43 | clear |
| 43 \(\Rightarrow\) 8 | clear |
| 8 \(\Rightarrow\) 29 | Zermelo's Axiom of Choice, Moore, 1982, page 324 |
Here are the links and statements of the form equivalence classes referenced above:
| Howard-Rubin Number | Statement |
|---|---|
| 87-alpha: | \(DC(\aleph_{\alpha})\): Given a relation \(R\) such that for every subset \(Y\) of a set \(X\) with \(|Y|<\aleph_{\alpha}\), there is an \(x\in X\) with \(Y\mathrel R x\) then there is a function \(f:\aleph_{\alpha}\to X\) such that (\(\forall\beta < \aleph_{\alpha}\)) \(\{f(\gamma): \gamma < \beta\}\mathrel R f(\beta)\). |
| 43: | \(DC(\omega)\) (DC), Principle of Dependent Choices: If \(S\) is a relation on a non-empty set \(A\) and \((\forall x\in A) (\exists y\in A)(x S y)\) then there is a sequence \(a(0), a(1), a(2), \ldots\) of elements of \(A\) such that \((\forall n\in\omega)(a(n)\mathrel S a(n+1))\). See Tarski [1948], p 96, Levy [1964], p. 136. |
| 8: | \(C(\aleph_{0},\infty)\): |
| 29: | If \(|S| = \aleph_{0}\) and \(\{A_{x}: x\in S\}\) and \(\{B_{x}: x\in S\}\) are families of pairwise disjoint sets and \(|A_{x}| = |B_{x}|\) for all \(x\in S\), then \(|\bigcup^{}_{x\in S} A_{x}| = |\bigcup^{}_{x\in S} B_{x}|\). Moore, G. [1982], p 324. |
Comment: