Discrete Mathematical الرياضيات المتقطعة. Example 12 June 20162 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.

Slides:



Advertisements
Similar presentations
Nested Quantifiers Section 1.4.
Advertisements

Nested Quantifiers Needed to express statements with multiple variables Example 1: “x+y = y+x for all real numbers”  x  y(x+y = y+x) where the domains.
Section 1.3. More Logical Equivalences Constructing New Logical Equivalences We can show that two expressions are logically equivalent by developing.
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 1: (Part 2): The Foundations: Logic and Proofs.
Propositions and Connectives Conditionals and Bi-conditionals Quantifiers.
CSE 311 Foundations of Computing I Lecture 6 Predicate Logic Autumn 2011 CSE 3111.
1 Predicates and quantifiers Chapter 8 Formal Specification using Z.
Discrete Mathematics Math 6A Instructor: M. Welling.
 x (x 2  0) 1. True2. False.  x (3x + 2 = 12) 1. True2. False.
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 11 Introduction to Predicate Logic Limitations of Propositional Logic Predicates, quantifiers and propositions.
1 Predicates and Quantifiers CS 202, Spring 2007 Epp, Sections 2.1 and 2.2 Aaron Bloomfield.
Predicates and Quantifiers
Chapter 1: The Foundations: Logic and Proofs
CSci 2011 Discrete Mathematics Lecture 3 CSci 2011.
The Foundations: Logic and Proofs
Formal Logic Mathematical Structures for Computer Science Chapter Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
(CSC 102) Lecture 7 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
Nested Quantifiers. 2 Nested Iteration Let the domain be {1, 2, …, 10}. Let P(x, y) denote x > y.  x,  y, P(x, y) means  x, (  y, P(x, y) ) Is the.
Section 1.5. Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements.
Predicates and Quantified Statements M , 3.2.
Chapter 1, Part II With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Copyright © Curt Hill Quantifiers. Copyright © Curt Hill Introduction What we have seen is called propositional logic It includes.
CS203 Discrete Mathematical Structures Logic (2).
Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems or solving problems, creativity and insight.
Math 51/COEN 19 Day 3, 1.4 Quantifiers 1. 3 Predicates A lot like functions that return booleans Let P(x) denote x
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.
(CSC 102) Lecture 8 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
Predicates and Quantified Statements
Chapter 2 The Logic of Quantified Statements. Section 2.1 Intro to Predicates & Quantified Statements.
Nested Quantifiers Section 1.5.
CompSci 102 Discrete Math for Computer Science January 24, 2012 Prof. Rodger Slides modified from Rosen.
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 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.
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
Chapter 2 Symbolic Logic. Section 2-1 Truth, Equivalence and Implication.
CS 285- Discrete Mathematics Lecture 4. Section 1.3 Predicate logic Predicate logic is an extension of propositional logic that permits concisely reasoning.
Predicate Logic One step stronger than propositional logic Copyright © Curt Hill.
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
PREDICATES AND QUANTIFIERS COSC-1321 Discrete Structures 1.
Mathematics for Comter I Lecture 3: Logic (2) Propositional Equivalences Predicates and Quantifiers.
1 Introduction to Abstract Mathematics Chapter 3: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 3.1.
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.
Section 1.5. Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements.
Introduction to Predicates and Quantified Statements I Lecture 9 Section 2.1 Wed, Jan 31, 2007.
CSE15 Discrete Mathematics 01/23/17
CS203 Discrete Mathematical Structures
Chapter 1 The Foundations: Logic and Proofs
CHAPTER 1: LOGICS AND PROOF
Mathematics for Computer Science MIT 6.042J/18.062J
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 I
Lecture 1.3: Predicate Logic
Discrete Mathematics Lecture 3: Predicate and Quantifier
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
ICS 253: Discrete Structures I
Discrete Mathematics Lecture 4 Logic of Quantified Statements
Predicates and Quantifiers
Lecture 1.3: Predicate Logic
Presentation transcript:

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 any y<>0, x: y=1) d) Q(x,2): x+2=x-2 False

First: SOLUTION Q1. (5 pts) Show that the following argument form is invalid: 6/12/2016

Q2. Use the truth table to show if the argument is valid. " If this number is larger than 2, then its square is larger than 4." " This number is not larger than 2. " The square of this number is not larger than 4. p → q  p  q 6/12/2016

Predicates - multiple quantifiers (Nested quantifiers) To bind many variables, use many quantifiers! Example: P(x,y) = “x > y”  x P(x,y)  x  y P(x,y)  x  y P(x,y)  x P(x,3) a)True proposition b)False proposition c)Not a proposition d)No clue c)b)a)b)

6/12/2016 Predicates - the meaning of multiple 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. For every value of x we can find a (possibly different) y so that P(x,y) is true. P(x,y) true for at least one x, y pair. There is at least one x for which P(x,y) is always true. quantification order is not commutative.

6/12/2016 Predicates - the meaning of multiple quantifiers 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

6/12/2016 Multiple quantifiers (Examples)  x  y, P(x,y): For all x and for all y the relation P(x,y) is true. If two numbers are integers then their product is an integer. 2.  x  y, P(x,y): For all x there is some y such that P(x,y) is true. Every student has a favorite teacher Note: here and below in all examples concerning people, we shall assume that the domain is known and will not represent it neither separately, nor within the predicate expression.

6/12/2016 Multiple quantifiers (Examples) 3.  x  y, P(x,y): There is some x such that for all individuals y the relation P(x,y) is true. Someone is loved by everybody  x  y loves (y,x) There is a professor that is liked by all students 4.  x  y, P(x,y): There is some x and there is some y such that P(x,y) is true. Some students have favorite teachers

11 Extra exmples for multiple quantifiers  x  y P(x, y) –“For all x, there exists a y such that P(x,y)” –Example:  x  y (x+y == 0)  x  y P(x,y) –There exists an x such that for all y P(x,y) is true” –Example:  x  y (x*y == 0)

12 Order of quantifiers  x  y and  x  y are not equivalent!  x  y P(x,y) –P(x,y) = (x+y == 0) is false  x  y P(x,y) –P(x,y) = (x+y == 0) is true