Implications

We have the following indirect implication of form equivalence classes:

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

Implication Reference
168 \(\Rightarrow\) 100 clear
100 \(\Rightarrow\) 347 Partition principles and infinite sums of cardinal numbers, Higasikawa, M. 1995, Notre Dame J. Formal Logic
347 \(\Rightarrow\) 40 Partition principles and infinite sums of cardinal numbers, Higasikawa, M. 1995, Notre Dame J. Formal Logic
40 \(\Rightarrow\) 39 clear
39 \(\Rightarrow\) 8 clear
8 \(\Rightarrow\) 126 clear
126 \(\Rightarrow\) 131 clear

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

Howard-Rubin Number Statement
168:

Dual Cantor-Bernstein Theorem:\((\forall x) (\forall y)(|x| \le^*|y|\) and \(|y|\le^* |x|\) implies  \(|x| = |y|)\) .

100:

Weak Partition Principle:  For all sets \(x\) and \(y\), if \(x\precsim^* y\), then it is not the case that \(y\prec x\).

347:

Idemmultiple Partition Principle: If \(y\) is idemmultiple (\(2\times y\approx y\)) and \(x\precsim ^* y\), then \(x\precsim y\).

40:

\(C(WO,\infty)\):  Every well orderable set of non-empty sets has a choice function. Moore, G. [1982], p 325.

39:

\(C(\aleph_{1},\infty)\): Every set \(A\) of non-empty sets such that \(\vert A\vert = \aleph_{1}\) has a choice function. Moore, G. [1982], p. 202.

8:

\(C(\aleph_{0},\infty)\):

126:

\(MC(\aleph_0,\infty)\), Countable axiom of multiple choice: For every denumerable set \(X\) of non-empty sets there is a function \(f\) such that for all \(y\in X\), \(f(y)\) is a non-empty finite subset of \(y\).

131:

\(MC_\omega(\aleph_0,\infty)\): For every denumerable family \(X\) of pairwise disjoint non-empty sets, there is a function \(f\) such that for each \(x\in X\), f(x) is a non-empty countable subset of \(x\).

Comment:

Back