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\) 201 |
The dependence of some logical axioms on disjoint transversals and linked systems, Schrijver, A. 1978, Colloq. Math. |
201 \(\Rightarrow\) 88 |
The dependence of some logical axioms on disjoint transversals and linked systems, Schrijver, A. 1978, Colloq. Math. |
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. |
201: | Linking Axiom for Boolean Algebras: Every Boolean algebra has a maximal linked system. (\(L\subseteq B\) is linked if \(a\wedge b\neq 0\) for all \(a\) and \(b \in L\).) |
88: | \(C(\infty ,2)\): Every family of pairs has a choice function. |
Comment: