We have the following indirect implication of form equivalence classes:
Implication | Reference |
---|---|
264 \(\Rightarrow\) 202 |
Variations of Zorn's lemma, principles of cofinality, and Hausdorff's maximal principle, Part I and II, Harper, J. 1976, Notre Dame J. Formal Logic |
202 \(\Rightarrow\) 40 | clear |
40 \(\Rightarrow\) 39 | clear |
39 \(\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 |
---|---|
264: | \(H(C,P)\): Every connected relation \((X,R)\) contains a \(\subseteq\)-maximal partially ordered set. |
202: | \(C(LO,\infty)\): Every linearly ordered family of non-empty sets has a choice function. |
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)\): |
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: