Statement:
\(C(\aleph_{0},2)\): Every denumerable set of pairs has a choice function.
Howard_Rubin_Number: 80
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:
Mostowski-1948: On the principle of dependent choices
Book references
Note connections:
| Howard-Rubin Number | Statement | References |
|---|---|---|
| 80 A | \(UT(\aleph_0,2,\aleph_0)\): The union of denumerably many pairs is denumerable. |
|
| 80 B | \(UT(\aleph_0,2, WO)\): The union of denumerably many pairs can be well ordered. |
|