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\) 132 |
Sequential compactness and the axiom of choice, Brunner, N. 1983b, Notre Dame J. Formal Logic |
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. |
132: | \(PC(\infty, <\aleph_0,\infty)\): Every infinite family of finite sets has an infinite subfamily with a choice function. |
Comment: