We have the following indirect implication of form equivalence classes:
Implication | Reference |
---|---|
270 \(\Rightarrow\) 62 |
Restricted versions of the compactness theorem, Kolany, A. 1991, Rep. Math. Logic |
62 \(\Rightarrow\) 61 | clear |
61 \(\Rightarrow\) 250 | clear |
250 \(\Rightarrow\) 111 | clear |
Here are the links and statements of the form equivalence classes referenced above:
Howard-Rubin Number | Statement |
---|---|
270: | \(CT_{\hbox{fin}}\): The compactness theorem for propositional logic restricted to sets of formulas in which each variable occurs only in a finite number of formulas. |
62: | \(C(\infty,< \aleph_{0})\): Every set of non-empty finite sets has a choice function. |
61: | \((\forall n\in\omega, n\ge 2\))\((C(\infty,n))\): For each \(n\in\omega\), \(n\ge 2\), every set of \(n\) element sets has a choice function. |
250: | \((\forall n\in\omega-\{0,1\})(C(WO,n))\): For every natural number \(n\ge 2\), every well ordered family of \(n\) element sets has a choice function. |
111: | \(UT(WO,2,WO)\): The union of an infinite well ordered set of 2-element sets is an infinite well ordered set. |
Comment: