We have the following indirect implication of form equivalence classes:
Implication | Reference |
---|---|
271-n \(\Rightarrow\) 0 |
Here are the links and statements of the form equivalence classes referenced above:
Howard-Rubin Number | Statement |
---|---|
271-n: | If \(n\in\omega-\{0,1\}\), \(CT_{n}\): The compactness theorem for propositional logic restricted to sets of formulas in which each variable occurs in at most \(n\) formulas. |
0: | \(0 = 0\). |
Comment: