Implications

We have the following indirect implication of form equivalence classes:

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

Implication Reference
345 \(\Rightarrow\) 14 Topologie, Analyse Nonstandard et Axiome du Choix, Morillon, M. 1988, Universit\'e Blaise-Pascal
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\) 327 clear

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

Howard-Rubin Number Statement
345:

Rasiowa-Sikorski Axiom:  If \((B,\land,\lor)\) is a Boolean algebra, \(a\) is a non-zero element of \(B\), and \(\{X_n: n\in\omega\}\) is a denumerable set of subsets of \(B\) then there is a maximal filter \(F\) of \(B\) such that \(a\in F\) and for each \(n\in\omega\), if \(X_n\subseteq F\) and \(\bigwedge X_n\) exists then \(\bigwedge X_n \in F\).

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.

327:

\(KW(WO,<\aleph_0)\),  The Kinna-Wagner Selection Principle for a well ordered family of finite sets: For every well ordered set \(M\) of finite sets there is a function \(f\) such that for all \(A\in M\), if \(|A|>1\)  then \(\emptyset\neq f(A)\subsetneq A\). (See Form 15.)

Comment:

Back