Form equivalence class Howard-Rubin Number: 14
Statement: The Completeness Theorem for Propositional Logic:Every consistent set of formulas is satisfiable. Henkin [1954a]and \cite{1954b}.
Howard-Rubin number: 14 CJ
Citations (articles):
Connections (notes):
References (books):
Back