清华大学人工智能课程ai3-ii herbrandtheorem [兼容模式]_458102953.pdf

Chapter 3 – part II Herbrand Theorem Root of Resolution Principle 1 Problem In the first-order logic, if the satisfiability or unsatisfiability of a sentence could be proved in finite time? Problem is Variables can potentially take on an infinite number of possible values from their domains 2 Godels Completeness Theorem Gödel‘s completeness theorem is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first-order logic . It was first proven by Kurt Gödel in 1929, “On Formally Undecidable Propositions of Principia Mathematica and Related Systems” If the system is consistent, it cannot be complete. The consistency of the axioms cannot be proven within the system. These theorems ended a half-century of attempts, beginning with the work of Frege and culminating in Principia Mathematica and Hilberts formalism, to find a set of axioms sufficient for all mathematics. The incompleteness theorems also imply that not all mathematical questions are computable. Godels Completeness Theorem says that FOL entailment is only semidecidable If a sentence is true given a set of axioms, there is a procedure that will determine this If the sentence is false, then there is no guarantee that a procedure will ever determine this—i.e., it may never halt 3 Introduction 1908-1931 Herbrands theorem is a fundamental result of mathematical logic obtained by Jacques Herbrand (1930). It essentially allows a certain kind of reduction of first-order logic to proposit