Statement:
\(C(\aleph_0,\le\aleph_0)\): Every denumerable set of non-empty countable sets has a choice function.
Howard_Rubin_Number: 32
Parameter(s): This form does not depend on parameters
This form's transferability is: Transferable
This form's negation transferability is: Negation Transferable
Article Citations:
Sierpi'nski-1918: L’axiome de M. Zermelo et son rˆole dans la th´eorie des ensembles et l’analyse
Book references
Note connections:
| Howard-Rubin Number | Statement | References |
|---|---|---|
| 32 A | \(C(\aleph_{0},\aleph_{0})\). Every denumerable set of denumerable sets has a choice function. |
|
| 32 B | \(PC(\aleph_0,\aleph_0,\infty)\): Every denumerable set of denumerable sets has an infinite subset with a choice function. |
|
| 32 C | \(PC(WO,\aleph_0,\infty)\): Every infinite well ordered set of denumerable sets has an infinite subset with a choice function. |
|