* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download PDF
Statistical inference wikipedia , lookup
Fuzzy logic wikipedia , lookup
History of the function concept wikipedia , lookup
Bayesian inference wikipedia , lookup
Foundations of mathematics wikipedia , lookup
Mathematical proof wikipedia , lookup
Peano axioms wikipedia , lookup
List of first-order theories wikipedia , lookup
History of logic wikipedia , lookup
Model theory wikipedia , lookup
Modal logic wikipedia , lookup
Combinatory logic wikipedia , lookup
Axiom of reducibility wikipedia , lookup
Interpretation (logic) wikipedia , lookup
Gödel's incompleteness theorems wikipedia , lookup
Propositional formula wikipedia , lookup
Laws of Form wikipedia , lookup
Curry–Howard correspondence wikipedia , lookup
Arrow's impossibility theorem wikipedia , lookup
Law of thought wikipedia , lookup
Mathematical logic wikipedia , lookup
Intuitionistic logic wikipedia , lookup
Quantum logic wikipedia , lookup
Principia Mathematica wikipedia , lookup
completeness theorem for propositional logic∗ CWoo† 2013-03-22 3:56:14 The completeness theorem of propositional logic is the statement that a wff is tautology iff it is a theorem. The if part of the statement is the soundness theorem, and the only if part is the completeness theorem. We will prove the two parts separately here. We begin with the easier one: Theorem 1. Propositional logic is sound with respect to truth-value semantics. Proof. Basically, we need to show that every axiom is a tautology, and that the inference rule modus ponens preserves truth. Since theorems are deduced from axioms and by applications of modus ponens, they are tautologies as a result. Using truth tables, one easily verifies that every axiom is true (under any valuation). For example, if the axiom is of the form A → (B → A), then we have Before proving the completeness portion of the theorem, we need the following Theorem 2. Propositional logic is complete with respect to truth-value semantics. ∗ hCompletenessTheoremForPropositionalLogici created: h2013-03-2i by: hCWooi version: h42526i Privacy setting: h1i hTheoremi h03B05i † This text is available under the Creative Commons Attribution/Share-Alike License 3.0. You can reuse this document or portions thereof only if you do so under terms that are compatible with the CC-BY-SA license. 1