We have the following indirect implication of form equivalence classes:
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\) 122 | clear |
122 \(\Rightarrow\) 47-n | 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. |
122: | \(C(WO,<\aleph_{0})\): Every well ordered set of non-empty finite sets has a choice function. |
47-n: | If \(n\in\omega-\{0,1\}\), \(C(WO,n)\): Every well ordered collection of \(n\)-element sets has a choice function. |
Comment: