We have the following indirect implication of form equivalence classes:
| Implication | Reference |
|---|---|
| 422-n \(\Rightarrow\) 111 | clear |
| 111 \(\Rightarrow\) 80 | clear |
| 80 \(\Rightarrow\) 18 | clear |
Here are the links and statements of the form equivalence classes referenced above:
| Howard-Rubin Number | Statement |
|---|---|
| 422-n: | \(UT(WO,n,WO)\), \(n\in \omega-\{0,1\}\): The union of a well ordered set of \(n\) element sets can be well ordered. |
| 111: | \(UT(WO,2,WO)\): The union of an infinite well ordered set of 2-element sets is an infinite well ordered set. |
| 80: | \(C(\aleph_{0},2)\): Every denumerable set of pairs has a choice function. |
| 18: | \(PUT(\aleph_{0},2,\aleph_{0})\): The union of a denumerable family of pairwise disjoint pairs has a denumerable subset. |
Comment: