We have the following indirect implication of form equivalence classes:
Implication | Reference |
---|---|
150 \(\Rightarrow\) 32 | clear |
32 \(\Rightarrow\) 10 | clear |
10 \(\Rightarrow\) 288-n | clear |
288-n \(\Rightarrow\) 373-n | clear |
Here are the links and statements of the form equivalence classes referenced above:
Howard-Rubin Number | Statement |
---|---|
150: | \(PC(\infty,\aleph_0,\infty)\): Every infinite set of denumerable sets has an infinite subset with a choice function. |
32: | \(C(\aleph_0,\le\aleph_0)\): Every denumerable set of non-empty countable sets has a choice function. |
10: | \(C(\aleph_{0},< \aleph_{0})\): Every denumerable family of non-empty finite sets has a choice function. |
288-n: | If \(n\in\omega-\{0,1\}\), \(C(\aleph_0,n)\): Every denumerable set of \(n\)-element sets has a choice function. |
373-n: | (For \(n\in\omega\), \(n\ge 2\).) \(PC(\aleph_0,n,\infty)\): Every denumerable set of \(n\)-element sets has an infinite subset with a choice function. |
Comment: