We have the following indirect implication of form equivalence classes:
| Implication | Reference |
|---|---|
| 408 \(\Rightarrow\) 62 | clear |
| 62 \(\Rightarrow\) 10 | clear |
| 10 \(\Rightarrow\) 423 | clear |
| 423 \(\Rightarrow\) 374-n | clear |
Here are the links and statements of the form equivalence classes referenced above:
| Howard-Rubin Number | Statement |
|---|---|
| 408: | If \(\{f_i: i\in I\}\) is a family of functions such that for each \(i\in I\), \(f_i\subseteq E\times W\), where \(E\) and \(W\) are non-empty sets, and \(\cal B\) is a filter base on \(I\) such that
|
| 62: | \(C(\infty,< \aleph_{0})\): Every set of non-empty finite sets has a choice function. |
| 10: | \(C(\aleph_{0},< \aleph_{0})\): Every denumerable family of non-empty finite sets has a choice function. |
| 423: | \(\forall n\in \omega-\{o,1\}\), \(C(\aleph_0, n)\) : For every \(n\in \omega - \{0,1\}\), every denumerable set of \(n\) element sets has a choice function. |
| 374-n: | \(UT(\aleph_0,n,\aleph_0)\) for \(n\in\omega -\{0,1\}\): The union of a denumerable set of \(n\)-element sets is denumerable. |
Comment: