Lecture 1.3: Predicate Logic

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/20/11 Ming-Hsuan Yang UC Merced 1.
Predicates and Quantifiers
CSci 2011 Discrete Mathematics Lecture 3 CSci 2011.
Lecture 3.1: Mathematical Induction CS 250, Discrete Structures, Fall 2014 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph Grunschlag.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
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.
Lecture 2.2: Set Theory* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.
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.
Chapter 1: The Foundations: Logic and Proofs
CSS342: Quantifiers1 Professor: Munehiro Fukuda. CSS342: Quantifiers2 Review of Propositions Proposition: a statement that is either true or false, but.
Lecture 7 – Jan 28, Chapter 2 The Logic of Quantified Statements.
Lecture 1.3: Predicate Logic CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.
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.
Lecture 2.2: Set Theory CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.
Lecture 1.2: Equivalences, and Predicate Logic CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph.
Lecture 1.4: Rules of Inference, and Proof Techniques* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.
Discrete Mathematics Mathematical reasoning: think logically; know how to prove Combinatorial analysis: know how to count Discrete structures: represent.
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
Lecture 1.3: Predicate Logic, and Rules of Inference* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
Lecture 1.5: Proof Techniques CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren 1.
Introduction to Predicates and Quantified Statements I Lecture 9 Section 2.1 Wed, Jan 31, 2007.
9/29/2011Lecture Strong Induction1 Lecture 3.2: Strong Induction CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures.
Discrete Mathematical الرياضيات المتقطعة. Example 12 June OR Q(x,y): x+y=x-y a) Q(1,1): 2=0 False b) Q(2,0): 2+0=2-0 True c) Q(1,y): 1+y=1-y False(take.
9/27/2011 Lecture Mathematical Induction1 Lecture 3.1: Mathematical Induction* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from.
Lecture 1.5: Proof Techniques
Logic Hubert Chan [O1 Abstract Concepts] [O2 Proof Techniques]
Lecture 1.2: Equivalences, and Predicate Logic
Advanced Algorithms Analysis and Design
CSE15 Discrete Mathematics 01/23/17
CSNB 143 Discrete Mathematical Structures
Lecture 1.4: Rules of Inference
Discrete Mathematics.
6/20/2018 Arab Open University Faculty of Computer Studies M131 - Discrete Mathematics 6/20/2018.
Lecture 1.5: Proof Techniques
Logic Hubert Chan [O1 Abstract Concepts] [O2 Proof Techniques]
Negations of Quantified Statements
Lecture 3.2: Induction and Strong Induction (contd.)
CMSC Discrete Structures
Chapter 1 The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
Copyright © Cengage Learning. All rights reserved.
Lecture 3.2: Induction, and Strong Induction
Lecture 3.2: Induction and Strong Induction (contd.)
Week #2 – 4/6 September 2002 Prof. Marie desJardins
Introduction to Predicates and Quantified Statements I
Lecture 3.2: Induction, and Strong Induction
Lecture 3.2: Induction, and Strong Induction
Negations of quantifiers
Lecture 1.6: Proof Techniques (contd)
Lecture 1.3: Predicate Logic
CS 250, Discrete Structures, Fall 2013
Lecture 3.1: Mathematical Induction
Lecture 1.6: Proof Techniques (contd)
Predicates and Quantifiers
CS 250, Discrete Structures, Fall 2014 Nitesh Saxena
Copyright © Cengage Learning. All rights reserved.
CPSC 121: Models of Computation
Lecture 1.4: Rules of Inference
Lecture 3.1: Mathematical Induction
CS 250, Discrete Structures, Fall 2015 Nitesh Saxena
Presentation transcript:

Lecture 1.3: Predicate Logic CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren

Lecture 1.3 - Predicate Logic Course Admin Slides from last lectures all online Both ppt and pdf Any questions? 9/14/2019 Lecture 1.3 - Predicate Logic

Lecture 1.3 - Predicate Logic Outline Predicate Logic (contd.) 9/14/2019 Lecture 1.3 - Predicate Logic

Quantifiers – another way to look at them To simplify, let us say that the universe of discourse is {x1, x2 } x P(x)  P(x1)  P(x2) x P(x)  P(x1)  P(x2) This is very useful in proving equivalences involving propositions that use quantifiers Let us see some examples 9/14/2019 Lecture 1.3 - Predicate Logic

Lecture 1.3 - Predicate Logic Laws and Quantifiers Negation or De Morgan’s Law (we saw this last time): x P(x)  x P(x) x P(x)  x P(x) Distributivity: x (P(x)  Q(x))  x P(x)  x Q(x) x (P(x)  Q(x))  x P(x)  x Q(x) Can’t distribute universal quantifier over disjunciton or existential quantifier over conjunction 9/14/2019 Lecture 1.3 - Predicate Logic

Predicates – Free and Bound Variables A variable is bound if it is known or quantified. Otherwise, it is free. Examples: P(x) x is free P(5) x is bound to 5 x P(x) x is bound by quantifier Reminder: in a proposition, all variables must be bound. 9/14/2019 Lecture 1.3 - Predicate Logic

Predicates – Nested Quantifiers To bind many variables, use many quantifiers! Example: P(x,y) = “x > y”; universe of discourse is natural numbers x P(x,y) xy P(x,y) xy P(x,y) x P(x,3) c) True proposition False proposition Not a proposition No clue b) b) b) 9/14/2019 Lecture 1.3 - Predicate Logic

Predicates – Meaning of Nested Quantifiers xy P(x,y) xy P(x,y) xy P(x,y) xy P(x,y) P(x,y) true for all x, y pairs. P(x,y) true for at least one x, y pair. For every value of x we can find a y so that P(x,y) is true. There is at least one x for which P(x,y) is always true. Suppose P(x,y) = “x’s favorite class is y.” 1 and 2 are commutative 3 and 4 are not commutative 9/14/2019 Lecture 1.3 - Predicate Logic

Nested Quantifiers – example N(x,y) = “x is sitting by y” xy N(x,y) xy N(x,y) xy N(x,y) xy N(x,y) False True True False 9/14/2019 Lecture 1.3 - Predicate Logic

Today’s Reading and Next Lecture Rosen 1.5 Again, please start solving the exercises at the end of each chapter section! Please read 1.6 and 1.7 in preparation for the next lecture 9/14/2019 Lecture 1.3 - Predicate Logic