2009/91 Predicates and Quantifiers (§1.3) In the sentence “x is greater than 3”: The phrase “x” denotes the subject - the object or entity that the sentence.

Slides:



Advertisements
Similar presentations
Nested Quantifiers Section 1.4.
Advertisements

The Logic of Quantified Statements
CS 285- Discrete Mathematics
Section 1.3. More Logical Equivalences Constructing New Logical Equivalences We can show that two expressions are logically equivalent by developing.
Propositions and Connectives Conditionals and Bi-conditionals Quantifiers.
1 Predicate Logic Rosen 6 th ed., § Predicate Logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
Module #1 - Logic 5/16/2015Michael Frank / Kees van Deemter1 Predicate Logic Rosen 5 th ed., §§ (but much extended) ~135 slides, ~5 lectures.
CSE 311 Foundations of Computing I Lecture 6 Predicate Logic Autumn 2011 CSE 3111.
Predicate Logic and Quantifies
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
Predicates and Quantifiers
Section 1.3: Predicates and Quantifiers
Predicates & Quantifiers Goal: Introduce predicate logic, including existential & universal quantification Introduce translation between English sentences.
Module #1 - Logic 8/28/2015Michael Frank / Kees van Deemter1 Remember: I. Construct a model where 1 and 4 are true, while 2 and 3 are false Let the u.d.
Predicates and Quantifiers
Chapter 1: The Foundations: Logic and Proofs
CSci 2011 Discrete Mathematics Lecture 3 CSci 2011.
The Foundations: Logic and Proofs
Logical Equivalence & Predicate Logic
資訊科學數學 6 : Predicates, Quantifiers & Mathematical Induction 陳光琦助理教授 (Kuang-Chi Chen)
Discrete Mathematics Chapter 1 The Foundations : Logic and Proofs 大葉大學 資訊工程系 黃鈴玲 (Lingling Huang)
CS 103 Discrete Structures Lecture 05
1.1 CompSci 102© Michael Frank Today’s topics Propositional equivalencesPropositional equivalences Predicate logicPredicate logic Reading: Sections Reading:
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Statements with Multiple Quantifiers. When a statement contains more than one quantifier, we imagine the actions suggested by the quantifiers as being.
1.1 CompSci 102© Michael Frank Today’s topics Boolean algebra previewBoolean algebra preview Propositional equivalencesPropositional equivalences Predicate.
Predicates and Quantified Statements
Chapter 2 The Logic of Quantified Statements. Section 2.1 Intro to Predicates & Quantified Statements.
Nested Quantifiers Section 1.5.
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,
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
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.
Lecture 7 – Jan 28, Chapter 2 The Logic of Quantified Statements.
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.
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.
Copyright © Peter Cappello 2011 Predicates & Quantifiers.
Discrete Mathematics Mathematical reasoning: think logically; know how to prove Combinatorial analysis: know how to count Discrete structures: represent.
Section 1.5 and 1.6 Predicates and Quantifiers. Vocabulary Predicate Domain Universal Quantifier Existential Quantifier Counterexample Free variable Bound.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Section 1.5. Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements.
1 Section 7.1 First-Order Predicate Calculus Predicate calculus studies the internal structure of sentences where subjects are applied to predicates existentially.
Propositional Logic. Assignment Write any five rules each from two games which you like by using propositional logic notations.
Module #1 - Logic 2016/7/91 Module #1: Logic (Textbook: §1.1~1.4) Dr. Chih-Wei Yi Department of Computer Science National Chiao Tung University.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 1 Predicates and Quantifiers 1.4.
Logic Hubert Chan [O1 Abstract Concepts] [O2 Proof Techniques]
3. The Logic of Quantified Statements Summary
Discrete Math - Module #1 - Logic
Predicates & Quantifiers
Logic Hubert Chan [O1 Abstract Concepts] [O2 Proof Techniques]
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
CSI 2101 / Predicate logic (§ ):
Discrete Math - Module #1 - Logic
Discrete Mathematics and its Applications
Nested Quantifiers Nested quantifiers are often necessary to express the meaning of sentences in English as well as important concepts in computer science.
Introduction to Predicates and Quantified Statements II
Predicate Logic (§1.3) Predicate logic is an extension of propositional logic that permits concisely reasoning about whole classes of entities. Propositional.
Week #2 – 4/6 September 2002 Prof. Marie desJardins
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Discrete Mathematics Lecture 3: Predicate and Quantifier
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Predicates and Quantifiers
Presentation transcript:

2009/91 Predicates and Quantifiers (§1.3) In the sentence “x is greater than 3”: The phrase “x” denotes the subject - the object or entity that the sentence is about. The phrase “is greater than 3” denotes the predicate- a property that is true of the subject. In predicate logic, a predicate is modeled as a function P(·) from objects (universal of discourse, u.d.) to propositions. P(x) = “x>3” (where x is any object). 述詞量詞 (論域;定義域)

2009/92 Propositional Functions View P(x) as a function defined on a set (e.g. R) to the set {true, false}. E.g. let P(x) = “x>3”, then if x=“5”, then P(5) = “5>3”. This is a proposition and the truth value of this proposition is true. The truth value of P(  3.3) is false. 命題函數

2009/93 Quantifier Expressions Quantifiers provide a notation that allows us to quantify (count) how many objects in the univ. of disc. satisfy a given predicate. “  ” is the FOR  LL or universal quantifier.  x P(x) means for all x in the u.d., P holds. “  ” is the  XISTS or existential quantifier.  x P(x) means there exists an x in the u.d. (that is, 1 or more) such that P(x) is true.

2009/94 The Universal Quantifier  Example: Let the u.d. of x be parking spaces at ISU. Let P(x) be the predicate “x is full.” Then the universal quantification of P(x),  x P(x), is the proposition: “All parking spaces at ISU are full.” “Every parking space at ISU is full.” “For each parking space at ISU, that space is full.” 全稱量詞

2009/95 The Existential Quantifier  Example: Let the u.d. of x be parking spaces at ISU. Let P(x) be the predicate “x is full.” Then the existential quantification of P(x),  x P(x), is the proposition: “Some parking space at ISU is full.” “There is a parking space at ISU that is full.” “At least one parking space at ISU is full.” 存在量詞

2009/96 Nested Quantifiers (§1.4) The negation of Quantifications The negation of universal quantification  (  x P(x))   x  P(x) The negation of existential quantification  (  x P(x))   x  P(x) 群組量詞

2009/97 Defining New Quantifiers As per their name, quantifiers can be used to express that a predicate is true of any given quantity (number) of objects. Define  !x P(x) to mean “P(x) is true of exactly one x in the universe of discourse.”  !x P(x)   x ( P(x)   y ( P(y)  y  x ) ) “There is an x such that P(x), where there is no y such that P(y) and y is other than x.”

2009/98 Calculus Example One way of precisely defining the calculus concept of a limit, using quantifiers:

2009/99 Example P(x, y) has 2 free variables, x and y. Let L(x, y)=“x likes y” Then  y L(x, y) = “There is someone whom x likes.” (A predicate with 1 free variable, x) Then  x (  y L(x,y)) = “Everyone has someone whom they like.” (A predicate with 0 free variable.)

2009/910 Quantifier Exercise If R(x,y)=“x relies upon y,” express the following in unambiguous English:  x(  y R(x,y))=  y(  x R(x,y))=  x(  y R(x,y))=  y(  x R(x,y))=  x(  y R(x,y))= Everyone has someone to rely on. There’s a poor overburdened soul whom everyone relies upon (including himself)! There’s some needy person who relies upon everybody (including himself). Everyone has someone who relies upon them. Everyone relies upon everybody, (including themselves)! Topic #3 – Predicate Logic

2009/911 Still More Conventions Sometimes the universe of discourse is restricted within the quantification, e.g.,  x>0 P(x) “For all x that are greater than zero, P(x).” i. e.  x ( x>0  P(x) )  x>0 P(x) “There is an x greater than zero such that P(x).” i. e.  x ( x>0  P(x) ) Topic #3 – Predicate Logic

2009/912 Quantifier Equivalence Laws Definitions of quantifiers: If u.d.=a,b,c,…  x P(x)  P(a)  P(b)  P(c)  …  x P(x)  P(a)  P(b)  P(c)  … From those, we can prove the laws:  x P(x)   x  P(x)  x P(x)   x  P(x) Which propositional equivalence laws can be used to prove this? Topic #3 – Predicate Logic

2009/913 More Equivalence Laws  x  y P(x,y)   y  x P(x,y)  x  y P(x,y)   y  x P(x,y)  x (P(x)  Q(x))  (  x P(x))  (  x Q(x))  x (P(x)  Q(x))  (  x P(x))  (  x Q(x)) Topic #3 – Predicate Logic

2009/914 Number Theory Example Let u.d. = the natural numbers 0, 1, 2, … “A number x is even, E(x), if and only if it is equal to 2 times some other number.”  x (E(x)  (  y x=2y)) Topic #3 – Predicate Logic

2009/915 Express the statement into common sentance P(x, y) “ 義守大學的學生 x 選了 y 這門課 。 ”  x  y P(x, y)  x  y P(x, y)  x  y P(x, y)  x  y P(x, y) 每個義大的學生都選至少一門課。 有個義大的學生選了一門課。 每個義大的學生都選了每一門課。 有個義大的學生選了每一門課。