Definition
Finitely Satisfiable Formula Set (Propositional Logic)
Let
be a formula set over a set of propositional variables. The set is finitely satisfiable if every finite subset of is satisfiable: Here
is an assignment and its extension to formulas. The assignment may depend on , but must make all formulas within that subset true simultaneously. The set itself need not be finite.