Form equivalence class Howard-Rubin Number: 14
Statement: The Compactness Theorem for Propositional Logic:If \(\Sigma\) is a set of formulas in a propositional language such thatevery finite subset of \(\Sigma\) is satisfiable, then \(\Sigma\) issatisfiable. Henkin [1954b].
Howard-Rubin number: 14 AW
Citations (articles):
Connections (notes):
References (books):
Back