Form equivalence class Howard-Rubin Number: 0
Statement:
\(CT_{1}\): Restricted Compactness Theorem for Propositional Logic I: If \(\Sigma\) is a set of formulas in a propositional language such that every finite subset of \(\Sigma\)is satisfiable and if each propositional variable occurs in at most one formula in \(\Sigma\), then \(\Sigma\) is satisfiable.
Howard-Rubin number: 0 AA
Citations (articles):
Kolany/Wojtylak [1991]
Restricted versions of the compactness theorem
Connections (notes):
References (books):
Back