Gödel’s Completeness Theorem for the Logic of Clauses
Part of the UNITEXT book series (UNITEXT)
This fundamental theorem shows the equivalence of two at first sight different properties of a set of clauses S:
satisfiability, or the existence of a model of S;
coherence (= irrefutability = consistency), i.e., the impossibility of obtaining the empty clause when applying DPP to a finite subset of S/H S .
KeywordsPropositional Logic Finite Subset Completeness Theorem Mechanical Procedure Empty Clause
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
© Springer-Verlag Italia 2012