Implications

We have the following indirect implication of form equivalence classes:

317 \(\Rightarrow\) 111
given by the following sequence of implications, with a reference to its direct proof:

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\) 121 clear
121 \(\Rightarrow\) 122 clear
122 \(\Rightarrow\) 250 clear
250 \(\Rightarrow\) 111 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.

121:

\(C(LO,<\aleph_{0})\): Every linearly ordered set of non-empty finite sets has a choice function.

122:

\(C(WO,<\aleph_{0})\): Every well ordered set of non-empty finite sets has a choice function.

250:

\((\forall n\in\omega-\{0,1\})(C(WO,n))\): For every natural number \(n\ge 2\), every well ordered family of \(n\) element sets has a choice function.

111:

\(UT(WO,2,WO)\): The union of an infinite well ordered set of 2-element sets is an infinite well ordered set.

Comment:

Back