We have the following indirect implication of form equivalence classes:

168 \(\Rightarrow\) 328
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\) 328 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.

328:

\(MC(WO,\infty)\): For  every well ordered set \(X\) such that for all \(x\in X\), \(|x|\ge 1\), there is a function \(f\) such that and for every \(x\in X\), \(f(x)\) is a finite, non-empty subset of \(x\). (See Form 67.)

Comment:

Back