Let us consider a finite or denumerable set S of formulas. We recall that a Boolean valuation v is said to satisfy S iff all the elements of S are true under v, and that S is satisfiable iff S is satisfied by at least one Boolean valuation.
KeywordsFinite Subset Compactness Theorem Propositional Variable Disjunctive Normal Form Analytic Proof
Unable to display preview. Download preview PDF.