Statement:
2-SAT: Restricted Compactness Theorem for Propositional Logic III: If \(\Sigma\) is a set of formulas in a propositional language such that every finite subset of \(\Sigma\) is satisfiable and if every formula in \(\Sigma\) is a disjunction of at most two literals, then \(\Sigma\) is satisfiable. (A literal is a propositional variable or its negation.) Wojtylak [1999] (listed as Wojtylak [1995])
Howard_Rubin_Number: 326
Parameter(s): This form does not depend on parameters
This form's transferability is: Unknown
This form's negation transferability is: Negation Transferable
Article Citations:
Book references
Note connections: