Definition
Satisfiable Formula Set (Propositional Logic)
Let
be a formula set over a set of propositional variables. The set is satisfiable if Here
is an assignment and its extension to formulas. One assignment must make every formula in true simultaneously.