We have the following indirect implication of form equivalence classes:
Implication | Reference |
---|---|
257 \(\Rightarrow\) 260 |
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 |
260 \(\Rightarrow\) 40 |
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 |
40 \(\Rightarrow\) 39 | clear |
39 \(\Rightarrow\) 8 | clear |
8 \(\Rightarrow\) 9 | Was sind und was sollen die Zollen?, Dedekind, [1888] |
9 \(\Rightarrow\) 17 |
The independence of Ramsey's theorem, Kleinberg, E.M. 1969, J. Symbolic Logic |
17 \(\Rightarrow\) 132 |
Amorphe Potenzen kompakter Raume, Brunner, N. 1984b, Arch. Math. Logik Grundlagenforschung |
132 \(\Rightarrow\) 73 | clear |
Here are the links and statements of the form equivalence classes referenced above:
Howard-Rubin Number | Statement |
---|---|
257: | \(Z(TR,P)\): Every transitive relation \((X,R)\) in which every partially ordered subset has an upper bound, has a maximal element. |
260: | \(Z(TR\&C,P)\): If \((X,R)\) is a transitive and connected relation in which every partially ordered subset has an upper bound, then \((X,R)\) has a maximal element. |
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)\): |
9: | Finite \(\Leftrightarrow\) Dedekind finite: \(W_{\aleph_{0}}\) Jech [1973b]: \(E(I,IV)\) Howard/Yorke [1989]): Every Dedekind finite set is finite. |
17: | Ramsey's Theorem I: If \(A\) is an infinite set and the family of all 2 element subsets of \(A\) is partitioned into 2 sets \(X\) and \(Y\), then there is an infinite subset \(B\subseteq A\) such that all 2 element subsets of \(B\) belong to \(X\) or all 2 element subsets of \(B\) belong to \(Y\). (Also, see Form 325.), Jech [1973b], p 164 prob 11.20. |
132: | \(PC(\infty, <\aleph_0,\infty)\): Every infinite family of finite sets has an infinite subfamily with a choice function. |
73: | \(\forall n\in\omega\), \(PC(\infty,n,\infty)\): For every \(n\in\omega\), if \(C\) is an infinite family of \(n\) element sets, then \(C\) has an infinite subfamily with a choice function. De la Cruz/Di Prisco [1998b] |
Comment: