Discrete Structures Predicate Logic 1 Dr. Muhammad Humayoun Assistant Professor COMSATS Institute of Computer Science, Lahore.

Slides:



Advertisements
Similar presentations
Nested Quantifiers Section 1.4.
Advertisements

1.3 Predicates and Quantifiers
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Discrete Mathematics Math 6A Instructor: M. Welling.
CSE115/ENGR160 Discrete Mathematics 01/25/11 Ming-Hsuan Yang UC Merced 1.
First Order Logic. Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
Lecture # 21 Predicates & Quantifiers
1 Predicates and Quantifiers CS 202, Spring 2007 Epp, Sections 2.1 and 2.2 Aaron Bloomfield.
Predicates and Quantifiers
Predicates & Quantifiers Goal: Introduce predicate logic, including existential & universal quantification Introduce translation between English sentences.
Predicates and Quantifiers
Chapter 1: The Foundations: Logic and Proofs
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
CS 103 Discrete Structures Lecture 05
1 Predicates and Quantifiers CS/APMA 202, Spring 2005 Rosen, section 1.3 Aaron Bloomfield.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
© Jalal Kawash 2010Peeking into Computer Science George Boole English Mathematician His The Mathematical Analysis of Logic, 1848 is the first.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Lecture 1.2: Equivalences, and Predicate Logic* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren, Zeph.
CT214 – Logical Foundations of Computing Lecture 6 Predicate Calculus.
1 Predicate (Relational) Logic 1. Introduction The propositional logic is not powerful enough to express certain types of relationship between propositions.
CS203 Discrete Mathematical Structures Logic (2).
January 30, 2002Applied Discrete Mathematics Week 1: Logic and Sets 1 Let’s Talk About Logic Logic is a system based on propositions.Logic is a system.
Hazırlayan DISCRETE COMPUTATIONAL STRUCTURES Propositional Logic PROF. DR. YUSUF OYSAL.
Discrete Mathematics. Predicates - the universal quantifier 11/28/2015 Suppose P(x) is a predicate on some universe of discourse. Ex. B(x) = “x is carrying.
Predicates and Quantified Statements
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
Lecture Predicates and Quantifiers 1.4 Nested Quantifiers.
Discrete Mathematics CS 2610 August 22, Agenda Last class Propositional logic Logical equivalences This week Predicate logic & rules of inference.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 1 The Foundations: Logic and Proofs Predicates and Quantifiers.
Lecture 8 Predicate Logic TF4233 Mathematical Logic Semester 2, 2006/2007 Dr. Rolly Intan & Cherry Ballangan, MAIT Informatics Department, Petra Christian.
Discrete Structures – CNS 2300
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
Lecture 1.2: Equivalences, and Predicate Logic CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph.
Copyright © Peter Cappello 2011 Predicates & Quantifiers.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
321 Section, Week 2 Natalie Linnell. Extra Credit problem.
Section 1.5 and 1.6 Predicates and Quantifiers. Vocabulary Predicate Domain Universal Quantifier Existential Quantifier Counterexample Free variable Bound.
PREDICATES AND QUANTIFIERS COSC-1321 Discrete Structures 1.
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Introduction to Discrete Mathematics Discrete Mathematics: is the part of mathematics devoted to the study of discrete objects. Discrete Mathematics is.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 1 Predicates and Quantifiers 1.4.
Lecture 1.2: Equivalences, and Predicate Logic
Semantic Web Logic.
CSE15 Discrete Mathematics 01/23/17
CSNB 143 Discrete Mathematical Structures
Discrete Mathematics.
Predicates & Quantifiers
CS203 Discrete Mathematical Structures
Chapter 1 The Foundations: Logic and Proofs
CS201: Data Structures and Discrete Mathematics I
1.4 Predicates and Quantifiers
CS 220: Discrete Structures and their Applications
Mathematics for Computer Science MIT 6.042J/18.062J
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Discrete Mathematics Lecture 3: Predicate and Quantifier
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
George Boole English Mathematician
Predicates and Quantifiers
CS201: Data Structures and Discrete Mathematics I
Dr. Unnikrishnan P.C. Professor, EEE
Presentation transcript:

Discrete Structures Predicate Logic 1 Dr. Muhammad Humayoun Assistant Professor COMSATS Institute of Computer Science, Lahore. 1

Why Predicate Logic? Propositional Logic is not expressive enough – It cannot adequately express the meaning of statements in mathematics and in natural language Example 1: “Every computer connected to the university network is functioning properly.” No rules of propositional logic allow us to conclude the truth of the statement that: “The computer MATH3 is functioning properly.” 2

Why Predicate Logic? Example 2: “There is a computer on the university network that is under attack by an intruder.” "CS2 is under attack by an intruder" Predicate Logic is more expressive and powerful 3

Predicate Logic Proposition, YES or NO? = 5 X + 2 = 5 Computer X is under attack by an intruder X + 2 = 5 for any choice of X in {1, 2, 3} X + 2 = 5 for some X in {1, 2, 3} Computer X is under attack by an intruder for some X in {CS001, MATH034} 4

Predicate Logic Proposition, YES or NO? = 5YES X + 2 = 5 NO Computer X is under attack by an intruder NO X + 2 = 5 for any choice of X in {1, 2, 3} YES X + 2 = 5 for some X in {1, 2, 3} YES Computer X is under attack by an intruder for some X in {CS001, MATH034} YES 5

Propositional Functions 6

variable predicate function 7

Predicates A predicate is a declarative statement with at least one variable (i.e., unknown value). A predicate, or propositional function, is a function that takes some variable(s) as arguments and returns True or False. Fiaz eats pizza at least once a week. Define: – P(x) = “x eats pizza at least once a week.” – Note that P(x) is not a proposition, P(Fiaz) is. 8

Predicates 9

10

Quantification Quantification expresses the extent to which a predicate is true over a range of elements. In English, the words all, some, many, none, and few are used in quantifications. The area of logic that deals with predicates and quantifiers is called the predicate calculus. 11

Quantifiers A quantifier is “an operator that limits the variables of a proposition” Two types: – Universal – Existential 12

Universal quantifier 13

Universal quantifier 14

Universal quantifier 15

Universal quantifier 16

Quiz 17

Quiz 18

Quiz: Meaning in English 19

Quiz: Meaning in English 20

Example 21

Example 22

Example 23

Existential quantification 24

Existential quantification 25

Existential quantification 26

Existential quantification 27

Existential quantification 28

Example 29

Example 30

Examples 31

Examples 32

Examples 33

Examples 34

Examples 35

Examples 36

Examples 37

Examples 38

B(x) = “x is a hummingbird.” L(x) = “x is a large bird.” H(x) = “x lives on honey.” R(x) = “x is richly colored.” Universe of discourse is all creatures. All hummingbirds are richly colored. 39

40

B(x) = “x is a hummingbird.” L(x) = “x is a large bird.” H(x) = “x lives on honey.” R(x) = “x is richly colored.” Universe of discourse is all creatures. No large birds live on honey. 41

42

43

B(x) = “x is a hummingbird.” L(x) = “x is a large bird.” H(x) = “x lives on honey.” R(x) = “x is richly colored.” Universe of discourse is all creatures. Birds that do not live on honey are dully colored. 44

45

46