We have the following indirect implication of form equivalence classes:
Implication | Reference |
---|---|
391 \(\Rightarrow\) 399 | clear |
399 \(\Rightarrow\) 323 | clear |
323 \(\Rightarrow\) 62 | note-70 |
62 \(\Rightarrow\) 283 |
The well-ordered and well-orderable subsets of a set, Truss, J. K. 1973d, Z. Math. Logik Grundlagen Math. |
Here are the links and statements of the form equivalence classes referenced above:
Howard-Rubin Number | Statement |
---|---|
391: | \(C(\infty,LO)\): Every set of non-empty linearly orderable sets has a choice function. |
399: | \(KW(\infty,LO)\), The Kinna-Wagner Selection Principle for a set of linearly orderable sets: For every set of linearly orderable sets \(M\) there is a function \(f\) such that for all \(A\in M\), if \(|A|>1\) then \(\emptyset\neq f(A)\subsetneq A\). |
323: | \(KW(\infty,WO)\), The Kinna-Wagner Selection Principle for a family of well orderable sets: For every set \(M\) of well orderable sets there is a function \(f\) such that for all \(A\in M\), if \(|A| > 1\) then \(\emptyset\neq f(A)\subsetneq A\). (See Form 15.) |
62: | \(C(\infty,< \aleph_{0})\): Every set of non-empty finite sets has a choice function. |
283: | Cardinality of well ordered subsets: For all \(n\in\omega\) and for all infinite \(x\), \(|x^n| < |s(x)|\) where \(s(x)\) is the set of all well orderable subsets of \(x\). |
Comment: