Natural Deduction for Predicate Logic Bound Variable: A variable within the scope of a quantifier. – (x) Px – (  y) (Zy · Uy) – (z) (Mz  ~Nz) Free Variable:

Slides:



Advertisements
Similar presentations
Quantifiers and logical inference
Advertisements

Predicate Calculus Formal Methods in Verification of Computer Systems Jeremy Johnson.
Valid Arguments An argument is a sequence of propositions. All but the final proposition are called premises. The last statement is the conclusion. The.
Proofs in Predicate Logic A rule of inference applies only if the main operator of the line is the right main operator. So if the line is a simple statement,
Discussion #17 1/15 Discussion #17 Derivations. Discussion #17 2/15 Topics Derivations  proofs in predicate calculus Inference Rules with Quantifiers.
Inference and Resolution for Problem Solving
Predicate Calculus Subject / Predicate John / went to the store. The sky / is blue. Propositional Logic - uses statements Predicate Calculus - uses predicates.
Ch 1.3: Quantifiers Open sentences, or predicates, are sentences that contain one or more variables. They do not have a truth value until variables are.
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
Introduction to Logic for Artificial Intelligence Lecture 2 Erik Sandewall 2010.
Symbolization in Predicate Logic In Predicate Logic, statements predicate properties of specific individuals or members of a group. Singular Statement:
1 Predicates and Quantifiers CS 202, Spring 2007 Epp, Sections 2.1 and 2.2 Aaron Bloomfield.
Predicates and Quantifiers
Formal Logic Mathematical Structures for Computer Science Chapter Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
Proofs in Predicate Logic A rule of inference applies only if the main operator of the line is the right main operator. So if the line is a simple statement,
1st-order Predicate Logic (FOL)
CSCE 4613 Artificial Inteligence
(CSC 102) Lecture 7 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
Chapter 2 The Logic of Quantified Statements. Section 2.4 Arguments with Quantified Statements.
Beyond bruised shins and stubbed toes Clearing the path to global ebook sales.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
1 Section 7.2 Equivalent Formulas Two wffs A and B are equivalent, written A  B, if they have the same truth value for every interpretation. Property:
GOAL: MULTIPLY TWO POLYNOMIALS TOGETHER USING THE DISTRIBUTIVE PROPERTY ELIGIBLE CONTENT: A Multiplying Polynomials.
Splash Screen. Example 1 Write an Equation Given Roots (x – p)(x – q)=0Write the pattern. Simplify. Replace p with and q with –5. Use FOIL.
1. Given vectors a, b, and c: Graph: a – b + 2c and 3c – 2a + b 2. Prove that these following vectors a = 3i – 2j + k, b = i – 3j +5k, and c = 2i +j –
1 Predicate (Relational) Logic 1. Introduction The propositional logic is not powerful enough to express certain types of relationship between propositions.
Examples of the Unification Algorithm { X = int, Y = X  X } unify({ X = int, Y = X  X }) S=X, T=int, C’={Y = X  X} = [ X  int ] ; unify({ Y = int 
(CSC 102) Lecture 8 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
Scope, free variable, closed wff §In  X(A) or  X(A), where A is a wff : X is called the variable quantified over; A is said to be (within) the scope.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
1 Introduction to Abstract Mathematics Proofs in Predicate Logic , , ~, ,  Instructor: Hayk Melikya Purpose of Section: The theorems.
1 Section 9.1 Automatic Reasoning Recall that a wff W is valid iff ¬ W is unsatisfiable. Resolution is an inference rule used to prove unsatisfiability.
CSE (c) S. Tanimoto, 2008 Predicate Calculus II 1 Predicate Calculus 2 Outline: Unification: definitions, algorithm Formal interpretations and satisfiability.
1 CMSC 250 Chapter 2, Predicate Logic. 2 CMSC 250 Definitions l Subject / predicate John / went to the store. The sky / is blue. l Propositional logic-
Chapter 9: Syntax and Semantics II : Logic & Proofs July 23, 2009 Karin Howe.
1 Section 8.3 Higher-Order Logic A logic is higher-order if it allows predicate names or function names to be quantified or to be arguments of a predicate.
Statements Containing Multiple Quantifiers Lecture 11 Section 2.3 Mon, Feb 5, 2007.
1 Outline Quantifiers and predicates Translation of English sentences Predicate formulas with single variable Predicate formulas involving multiple variables.
Section 1.5 and 1.6 Predicates and Quantifiers. Vocabulary Predicate Domain Universal Quantifier Existential Quantifier Counterexample Free variable Bound.
Chapter Nine Predicate Logic Proofs. 1. Proving Validity The eighteen valid argument forms plus CP and IP that are the proof machinery of sentential logic.
Chapter Ten Relational Predicate Logic. 1. Relational Predicates We now broaden our coverage of predicate logic to include relational predicates. This.
LESSON 3-2 ANGLES AND PARALLEL LINES. Concept Example 1 Use Corresponding Angles Postulate A. In the figure, m  11 = 51. Find m  15.
1 Section 7.3 Formal Proofs in Predicate Calculus All proof rules for propositional calculus extend to predicate calculus. Example. … k.  x p(x) P k+1.
1 Section 7.1 First-Order Predicate Calculus Predicate calculus studies the internal structure of sentences where subjects are applied to predicates existentially.
BELL RINGER. MULTIPLYING A MONOMIAL BY A POLYNOMIAL.
Uniqueness Quantifier ROI for Quantified Statement.
3. The Logic of Quantified Statements Summary
8.1 Symbols and Translation
Rationale Behind the Precise Formulation of the Four Quantifier Rules
The Finite Universe Method
Chapter 1 The Foundations: Logic and Proofs
Today’s Topics Universes of Discourse
CS201: Data Structures and Discrete Mathematics I
A road map for predicate logic translation.
Introduction to Predicates and Quantified Statements II
Introduction to Predicates and Quantified Statements II
Mathematical Structures for Computer Science Chapter 1
1st-order Predicate Logic (FOL)
8.2 Using the Rule of Inference
Introduction to Predicates and Quantified Statements I
Proofs in Predicate Logic
Predicates and Quantifiers
Discrete Mathematics Lecture 4 Logic of Quantified Statements
Encoding Knowledge with First Order Predicate Logic
Encoding Knowledge with First Order Predicate Logic
CS201: Data Structures and Discrete Mathematics I
Chapter 4: Prolog (Substitution, Unification and Resolution)
Encoding Knowledge with First Order Predicate Logic
The Foundations: Logic and Proofs
1st-order Predicate Logic (FOL)
Presentation transcript:

Natural Deduction for Predicate Logic Bound Variable: A variable within the scope of a quantifier. – (x) Px – (  y) (Zy · Uy) – (z) (Mz  ~Nz) Free Variable: A variable not within the scope of a quantifier. – Px – Py · ~Qy – ~Az  Bz

Universal Instantiation (UI) – Used to remove a universal quantifier. – Consistently replace the bound variables with ANY free variable or ANY constant. – For example: (x) Px – Px (y) (~Cy  Sy) – ~Cz  Sz

(z) (Dz  ~Tz) – Da  ~Ta – These uses of UI are invalid because of inconsistent replacements. (x) (~Cx  Sx) – ~Cx  Sy (z) (Dz  ~Tz) – Da  ~Tb

Existential Generalization (EG) – Used to add an existential quantifier. – Consistently replace the constants or free variables with ANY bound variable and add (  x). – For example: Pa – (  x) Px ~Cm  Sm – (  y) (~Cy  Sy)

Dx · ~Tx – (  x) (Dx · ~Tx) – These uses of EG are invalid because of inconsistent replacements. ~Ca  Sb – (  x) (~Cx  Sy) Dy  ~Tz – (  x) (Dx  ~Tx)

Universal Generalization (UG) – Used to add a universal quantifier. – Consistently replace the free variables with ANY bound variable and add (x). – For example: Px – (x) Px ~Cy  Sy – (y) (~Cy  Sy) Dx · ~Tx – (z) (Dz · ~Tz)

– One may not use UG on statements containing constants. (All of these uses of UG are invalid.) La – (x) Lx Gb v ~Hb – (y) (Gy v ~Hy) ~Ne  Me – (z) (~Nz  Mz)

– These uses of UG are invalid because of inconsistent replacements. ~Cx  Sy – (x) (~Cx  Sy) Dy  ~Tz – (x) (Dx  ~Tx)

Existential Instantiation (EI) – Used to remove an existential quantifier. – Consistently replace the bound variables with ANY new constant, i.e. any constant that has not been previously used anywhere in the proof. – For example: 6.) Pa 7.) (  x) Qx 8.) Qb7 EI(valid) 8.) Qa7 EI(invalid)

1.) Sm v ~Gm.../ ~Tk · Wk 8.) (  y) (Ny · ~My) 9.) Na · ~Ma8 EI(valid) 9.) Nm · ~Mm8 EI(invalid) 9.) Nk · ~Mk8 EI(invalid)

– These uses of EI are invalid because of inconsistent replacements. (  x) (~Cx  Sy) – ~Ca  Sb (  x) (Dx  ~Tx) – Dn  ~Tm When one must both EI and UI to the same constant in a proof, do the EI first.

N. B.: The rules in Section 8.2 may NOT be used on parts of lines. – All of these moves are INVALID. (x) Zx  (x) ~Qx – Zx  ~ Qx (  z) Lz v (  z) Pz – Ln v Pn Tm  (y) (~Sy  Qy) – Tm  (~Sy  Qy)

N. B.: The rules from 7.1 and 7.2 may NOT be used on statements in which the WHOLE statement is quantified – These moves are INVALID. (x) (Ax  Bx) (  x) Ax (x) Bx (  x) (Cx v Dx) (x) ~Cx (  x) Dx

N. B.: The rules from 7.1 and 7.2 MAY be used on statements in which the parts, not the whole, are quantified. – These moves are VALID. (x) Ax  (  x) Bx (x) Ax (  x) Bx (  x) Dx v (x) Cx ~(  x) Dx (x) Cx