Predicate logic CSC 333.

Slides:



Advertisements
Similar presentations
Nested Quantifiers Section 1.4.
Advertisements

Artificial Intelligence
Rules of Inference Rosen 1.5.
1 First order theories (Chapter 1, Sections 1.4 – 1.5)
First Order Logic Logic is a mathematical attempt to formalize the way we think. First-order predicate calculus was created in an attempt to mechanize.
The Logic of Quantified Statements
1 A formula in predicate logic An atom is a formula. If F is a formula then (~F) is a formula. If F and G are Formulae then (F /\ G), (F \/ G), (F → G),
Logic Use mathematical deduction to derive new knowledge.
Valid Arguments An argument is a sequence of propositions. All but the final proposition are called premises. The last statement is the conclusion. The.
CS128 – Discrete Mathematics for Computer Science
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
Discrete Mathematics Math 6A Instructor: M. Welling.
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
For Friday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C. Graded.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
Predicates and Quantifiers
CSCI2110 – Discrete Mathematics Tutorial 9 First Order Logic Wong Chung Hoi (Hollis)
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
MATH 213 A – Discrete Mathematics for Computer Science Dr. (Mr.) Bancroft.
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
Formal Logic Mathematical Structures for Computer Science Chapter Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
Discrete Mathematics CS 2610 August 24, Agenda Last class Introduction to predicates and quantifiers This class Nested quantifiers Proofs.
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:
Fallacies The proposition [(p  q)  q]  p is not a tautology, because it is false when p is false and q is true. This type of incorrect reasoning is.
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Dr. Muhammed Al-Mulhem ICS An Introduction to Logical Programming.
CS6133 Software Specification and Verification
Chapter 1: The Foundations: Logic and Proofs
For Wednesday Read chapter 9, sections 1-3 Homework: –Chapter 7, exercises 8 and 9.
Propositional Logic Predicate Logic
Chapter 2 Symbolic Logic. Section 2-1 Truth, Equivalence and Implication.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Rules of inference.
1-1 An Introduction to Logical Programming Sept
Albert Gatt LIN3021 Formal Semantics Lecture 3. Aims This lecture is divided into two parts: 1. We make our first attempts at formalising the notion of.
1 Outline Quantifiers and predicates Translation of English sentences Predicate formulas with single variable Predicate formulas involving multiple variables.
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.
1 Chapter 2.1 Chapter 2.2 Chapter 2.3 Chapter 2.4 All images are copyrighted to their respective copyright holders and reproduced here for academic purposes.
2004/9/15fuzzy set theory chap02.ppt1 Classical Logic the forms of correct reasoning - formal logic.
1 Section 7.1 First-Order Predicate Calculus Predicate calculus studies the internal structure of sentences where subjects are applied to predicates existentially.
Chapter 1 Logic and proofs
Propositional Logic (a.k.a. Sentential Logic)
Introduction to Logic for Artificial Intelligence Lecture 2
Advanced Algorithms Analysis and Design
CSE15 Discrete Mathematics 01/23/17
CSNB 143 Discrete Mathematical Structures
Formal Logic CSC 333.
Chapter 8 Logic Topics
CS201: Data Structures and Discrete Mathematics I
CS 1502 Formal Methods in Computer Science
Logical Inferences: A set of premises accompanied by a suggested conclusion regardless of whether or not the conclusion is a logical consequence of the.
Logic Use mathematical deduction to derive new knowledge.
Mathematics for Computer Science MIT 6.042J/18.062J
Mathematical Structures for Computer Science Chapter 1
A Brief Summary for Exam 1
CS 220: Discrete Structures and their Applications
First Order Logic Rosen Lecture 3: Sept 11, 12.
Inference Rules: Tautologies
MA/CSSE 474 More Math Review Theory of Computation
Computer Security: Art and Science, 2nd Edition
Notes 8: Predicate logic and inference
Predicates and Quantifiers
Chapter 1: Propositional and First-Order Logic
CS201: Data Structures and Discrete Mathematics I
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
1.3 Propositional Equivalences
Logical and Rule-Based Reasoning Part I
Presentation transcript:

Predicate logic CSC 333

Terms Universal quantifier Existential quantifier Predicate Domain of Interpretation Dummy variable Free variable Predicate wff Unary, binary, ternary

Things to remember . . . The order of quantifiers is important (p. 36). Universal quantifier and implication go together. Existential quantifier and conjunction go together.

English is problematic . . . The meaning of the word “only” may depend on its placement. Even then . . . (p. 39) The use of “not” with universal quantifier (p. 41).

Validity A tautology is a propositional wff that is true for all rows of the truth table. A predicate wff is valid if it is true in all possible interpretations; a valid wff is “intrinsically true.” See Table 1.16

Inference rules using quantifiers Universal instantiation Consider restriction and Example 25 Existential instantiation Example 27 Universal generalization Example 28 Existential generalization Example 29

Heuristics Predicate logic rules apply only when the exact pattern of the rule is matched. The instantiation rules remove a quantifier from the front of the entire wff to which the quantifier applies. (P. 54) Insertion of a quantifier must be in front of a wff that is entirely within its scope. See “plan of attack”, p. 54.

Temporary hypothesis Not often needed. To prove P -> Q, it may be useful to assume P as a temporary hypothesis. Can’t be used if quantifier applies to P (Example 31).