Implications

We have the following indirect implication of form equivalence classes:

303 \(\Rightarrow\) 271-n
given by the following sequence of implications, with a reference to its direct proof:

Implication Reference
303 \(\Rightarrow\) 50 Some propositions equivalent to the Sikorski extension theorem for Boolean algebras, Bell, J.L. 1988, Fund. Math.
50 \(\Rightarrow\) 14 A survey of recent results in set theory, Mathias, A.R.D. 1979, Period. Math. Hungar.
14 \(\Rightarrow\) 270 Restricted versions of the compactness theorem, Kolany, A. 1991, Rep. Math. Logic
270 \(\Rightarrow\) 271-n Restricted versions of the compactness theorem, Kolany, A. 1991, Rep. Math. Logic

Here are the links and statements of the form equivalence classes referenced above:

Howard-Rubin Number Statement
303:

If \(B\) is a Boolean algebra, \(S\subseteq B\) and \(S\) is closed under \(\land\), then there is a \(\subseteq\)-maximal proper ideal \(I\) of \(B\) such that \(I\cap S= \{0\}\).

50:

Sikorski's  Extension Theorem: Every homomorphism of a subalgebra \(B\) of a Boolean algebra \(A\) into a complete Boolean algebra \(B'\) can be extended to a homomorphism of \(A\) into \(B'\). Sikorski [1964], p. 141.

14:

BPI: Every Boolean algebra has a prime ideal.

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.

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.

Comment:

Back