Form equivalence class Howard-Rubin Number: 14
Statement: 3-Sat: Restricted Compactness Theorem forPropositional Logic II: If \(\Sigma\) is a set of formulas in apropositional language such that every finite subset of \(\Sigma\)is satisfiable and if every formula in \(\Sigma\) is a disjunctionof at most three literals, then \(\Sigma\) is satisfiable.(A literal is a propositional variable or its negation.)Cowen [1990].
Howard-Rubin number: 14 CI
Citations (articles):
Connections (notes):
References (books):
Back