We have the following indirect implication of form equivalence classes:
Implication | Reference |
---|---|
317 \(\Rightarrow\) 14 |
Limitations on the Fraenkel-Mostowski method of independence proofs, Howard, P. 1973, J. Symbolic Logic |
14 \(\Rightarrow\) 49 |
A survey of recent results in set theory, Mathias, A.R.D. 1979, Period. Math. Hungar. |
49 \(\Rightarrow\) 30 | clear |
30 \(\Rightarrow\) 62 | clear |
62 \(\Rightarrow\) 378 | clear |
378 \(\Rightarrow\) 11 | clear |
Here are the links and statements of the form equivalence classes referenced above:
Howard-Rubin Number | Statement |
---|---|
317: | Weak Sikorski Theorem: If \(B\) is a complete, well orderable Boolean algebra and \(f\) is a homomorphism of the Boolean algebra \(A'\) into \(B\) where \(A'\) is a subalgebra of the Boolean algebra \(A\), then \(f\) can be extended to a homomorphism of \(A\) into \(B\). |
14: | BPI: Every Boolean algebra has a prime ideal. |
49: | Order Extension Principle: Every partial ordering can be extended to a linear ordering. Tarski [1924], p 78. |
30: | Ordering Principle: Every set can be linearly ordered. |
62: | \(C(\infty,< \aleph_{0})\): Every set of non-empty finite sets has a choice function. |
378: | Restricted Choice for Families of Well Ordered Sets: For every infinite set \(X\) there is an infinite subset \(Y\) of \(X\) such that the family of non-empty well orderable subsets of \(Y\) has a choice function. |
11: | A Form of Restricted Choice for Families of Finite Sets: For every infinite set \(A\), \(A\) has an infinite subset \(B\) such that for every \(n\in\omega\), \(n>0\), the set of all \(n\) element subsets of \(B\) has a choice function. De la Cruz/Di Prisco [1998b] |
Comment: