Lecture 8 Predicate Logic TF4233 Mathematical Logic Semester 2, 2006/2007 Dr. Rolly Intan & Cherry Ballangan, MAIT Informatics Department, Petra Christian.

Slides:



Advertisements
Similar presentations
Nested Quantifiers Section 1.4.
Advertisements

The Logic of Quantified Statements
CS 285- Discrete Mathematics
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
L41 Lecture 2: Predicates and Quantifiers.. L42 Agenda Predicates and Quantifiers –Existential Quantifier  –Universal Quantifier 
Lab 1 Chapter 1, Sections 1.1, 1.2, 1.3, and 1.4 Book: Discrete Mathematics and Its Applications By Kenneth H. Rosen.
RMIT University; Taylor's College This is a story about four people named Everybody, Somebody, Anybody and Nobody. There was an important job to be done.
Discrete Mathematics Lecture 2 Alexander Bukharovich New York University.
Discrete Mathematics Math 6A Instructor: M. Welling.
First Order Logic (chapter 2 of the book) Lecture 3: Sep 14.
Discrete Structures Chapter 3: The Logic of Quantified Statements
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.
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 and Quantifiers
Chapter 1: The Foundations: Logic and Proofs
CS104 : Discrete Structures
CSci 2011 Discrete Mathematics Lecture 3 CSci 2011.
MATH 213 A – Discrete Mathematics for Computer Science Dr. (Mr.) Bancroft.
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.
First Order Logic Lecture 2: Sep 9. This Lecture Last time we talked about propositional logic, a logic on simple statements. This time we will talk about.
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.
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Statements with Multiple Quantifiers. When a statement contains more than one quantifier, we imagine the actions suggested by the quantifiers as being.
CS203 Discrete Mathematical Structures Logic (2).
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
Chapter 2 The Logic of Quantified Statements. Section 2.1 Intro to Predicates & Quantified Statements.
1 Sections 1.3 and 1.4 Predicates & Quantifiers. 2 Propositional Functions In a mathematical assertion, such as x < 3, there are two parts: –the subject,
1 Introduction to Abstract Mathematics Predicate Logic Instructor: Hayk Melikya Purpose of Section: To introduce predicate logic (or.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 02: QUANTIFIERS Sections 1.3 and 1.4 Jarek Rossignac CS1050:
Lecture Predicates and Quantifiers 1.4 Nested Quantifiers.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 1 The Foundations: Logic and Proofs Predicates and Quantifiers.
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.
Discrete Structures Predicate Logic 1 Dr. Muhammad Humayoun Assistant Professor COMSATS Institute of Computer Science, Lahore.
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.
Predicates and Quantifiers
Discrete Mathematics Mathematical reasoning: think logically; know how to prove Combinatorial analysis: know how to count Discrete structures: represent.
Statements Containing Multiple Quantifiers Lecture 11 Section 2.3 Mon, Feb 5, 2007.
321 Section, Week 2 Natalie Linnell. Extra Credit problem.
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
CSE15 Discrete Mathematics 01/23/17
Lecture 03 Logic and Propositional Calculus Profs. Koike and Yukita
CS203 Discrete Mathematical Structures
CMSC Discrete Structures
Chapter 1 The Foundations: Logic and Proofs
CS201: Data Structures and Discrete Mathematics I
A road map for predicate logic translation.
Introduction to Predicates and Quantified Statements II
Discrete Math (2) Haiming Chen Associate Professor, PhD
Introduction to Predicates and Quantified Statements II
First Order Logic Rosen Lecture 3: Sept 11, 12.
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
Discrete Mathematics Lecture 4 Logic of Quantified Statements
CS201: Data Structures and Discrete Mathematics I
Presentation transcript:

Lecture 8 Predicate Logic TF4233 Mathematical Logic Semester 2, 2006/2007 Dr. Rolly Intan & Cherry Ballangan, MAIT Informatics Department, Petra Christian University

TF4233 Math. Logic Petra Christian University 2 Content 1. Predicate Logic 2. Quantifier 3. Translation Examples

TF4233 Math. Logic Petra Christian University 3 1. Predicate Logic “x is greater than 5” (the universe is real numbers) Is it a proposition ??

TF4233 Math. Logic Petra Christian University 4 Are these propositions? 4 is greater than 5. 8 is greater than 5. For all x, x is greater than 5. There is x such that x is greater than 5. (the universe is real numbers) 1. Predicate Logic

TF4233 Math. Logic Petra Christian University 5 Predicate logic is… 1. Predicate Logic P(x) : “x is greater than 5” (the universe is real numbers) Subject: x Predicate: “is greater than 5” P(4) : “4 is greater than 5” P(8) : “8 is greater than 5”  x P(x) : “For all x, x is greater 5”  x P(x) : “There is x such that x is greater than 5”

TF4233 Math. Logic Petra Christian University 6 2. Quantifier Universal Quantifier  “For all”, “For any”, “For every” Existential Quantifier  “There exists”, “Some”

TF4233 Math. Logic Petra Christian University 7 Example clever(x) : “x is clever” (universe: students)  x clever(x) : “All students are clever”  x clever(x) : “Some students are clever”  x clever(x) : “ Not all students are clever ”   x clever(x) : “No students is clever” 2. Quantifier

TF4233 Math. Logic Petra Christian University 8 Negation  x P(x)   x  P(x)   x P(x)   x  P(x) Example NOT ALL students are clever SOME students are NOT clever NO students is clever ALL students are NOT clever 2. Quantifier

TF4233 Math. Logic Petra Christian University 9 For more than one variable The order of the quantifiers is important! Example: Let P(x, y) : ”x + y = 0” (universal: Real)  x  y P(x, y)  y  x P(x, y) Let P(x, y, z): “x + y = z”  x  y  z P(x, y, z)  z  x  y P(x, y, z) 2. Quantifier

TF4233 Math. Logic Petra Christian University 10 Laws 1  x ( A(x)  B(x) )  (  x) A(x)  (  x) B(x)  x (A(x)  B(x))  (  x)A(x)  (  x)B(x)  (  x)A(x)  (  x)  A(x)  (  x)A(x)  (  x)  A(x) (  x)A(x)  (  x)B(x)   x(A(x)  B(x)) (  x)(A(x)  B(x))  (  x)A(x)  (  x)B(x)  x(A  B(x))  A  (  x)B(x) 2. Quantifier

TF4233 Math. Logic Petra Christian University 11 Laws 2  x(A  B(x))  A  (  x)B(x) (  x)(A(x)  B)  (  x)(A(x)  B) (  x)A(x)  B  (  x)(A(x)  B) A  (  x)B(x)  (  x)(A  B(x)) A  (  x)B(x)  (  x)(A  B(x))  xP(x)  P(c), for any c element univ. P(c )  xP(x) 2. Quantifier

TF4233 Math. Logic Petra Christian University Translation Example Translate into predicate logic: i) “All lions are fierce.” ii) ”Some lions do not drink coffee.” iii) “Some fierce creature don’t drink coffee.” Example 1

TF4233 Math. Logic Petra Christian University Translation Example Example 1 Answer

TF4233 Math. Logic Petra Christian University Translation Example Example 2 i). “All Hummingbirds are richly colored.” ii). “No large birds live on honey.” iii). “Birds that do not live on honey are dull in color.” iv). “Hummingbirds are small.”

TF4233 Math. Logic Petra Christian University Translation Example Example 2 Answer

TF4233 Math. Logic Petra Christian University 16 Exercises Translate the following statements into predicate logic: All students in this class have studied Calculus. No students in this class have studied Discrete Mathematics. If P(x) means “x + 1 > x” (the universe is real number), determine the truth value of the following statements:  xP(x)  xP(x)

TF4233 Math. Logic Petra Christian University 17 Exercises Negate the following statements:  x |x| = x  x x2 = x All students live in dormitories All math majors are males Some students are 25 years or older If there is a riot then someone is killed It is daylight and all the people have arisen