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\) 178-n-N | 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. |
178-n-N: | If \(n\in\omega\), \(n\ge 2\) and \(N \subseteq \{ 1, 2, \ldots , n-1 \}\), \(N \neq\emptyset\), \(MC(\infty,n, N)\): If \(X\) is any set of \(n\)-element sets then there is a function \(f\) with domain \(X\) such that for all \(A\in X\), \(f(A)\subseteq A\) and \(|f(A)|\in N\). |
Comment: