Implications

We have the following indirect implication of form equivalence classes:

407 \(\Rightarrow\) 336-n
given by the following sequence of implications, with a reference to its direct proof:

Implication Reference
407 \(\Rightarrow\) 14 Effective equivalents of the Rasiowa-Sikorski lemma, Bacsich, P. D. 1972b, J. London Math. Soc. Ser. 2.
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\) 336-n clear

Here are the links and statements of the form equivalence classes referenced above:

Howard-Rubin Number Statement
407:

Let \(B\) be a Boolean algebra, \(b\) a non-zero element of \(B\) and \(\{A_i: i\in\omega\}\) a sequence of subsets of \(B\) such that for each \(i\in\omega\), \(A_i\) has a supremum \(a_i\). Then there exists an ultrafilter \(D\) in \(B\) such that \(b\in D\) and, for each \(i\in\omega\), if \(a_i\in D\), then \(D\cap\ A_i\neq\emptyset\).

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.

336-n:

(For \(n\in\omega\), \(n\ge 2\).)  For every infinite set \(X\), there is an infinite \(Y \subseteq X\) such that the set of all \(n\)-element subsets of \(Y\) has a choice function.

Comment:

Back