Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.

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.
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.
Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
CSE 311 Foundations of Computing I Lecture 6 Predicate Logic Autumn 2011 CSE 3111.
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
Discrete Mathematics Math 6A Instructor: M. Welling.
CSE115/ENGR160 Discrete Mathematics 01/25/11 Ming-Hsuan Yang UC Merced 1.
Nested Quantifiers Goals: Explain how to work with nested quantifiers
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
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 2011 Discrete Mathematics Lecture 3 CSci 2011.
The Foundations: Logic and Proofs
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
MATH 213 A – Discrete Mathematics for Computer Science Dr. (Mr.) Bancroft.
Discrete Mathematics and Its Applications
Chapter 1: The Foundations: Logic and Proofs
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Chapter 1 The Foundations: Logic and Proofs 歐亞書局.
CS 103 Discrete Structures Lecture 05
(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.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
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.
Nesting Quantifiers And Their Manipulation Copyright © Curt Hill.
Statements with Multiple Quantifiers. When a statement contains more than one quantifier, we imagine the actions suggested by the quantifiers as being.
Math 51/COEN 19 Day 3, 1.4 Quantifiers 1. 3 Predicates A lot like functions that return booleans Let P(x) denote x
 I can identify and use the properties of real numbers.
(CSC 102) Lecture 8 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
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,
Chapter 1: The Foundations: Logic and Proofs
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.
Predicates and Quantifiers Dr. Yasir Ali. 1.Predicates 2.Quantifiers a.Universal Quantifiers b.Existential Quantifiers 3.Negation of Quantifiers 4.Universal.
Predicate Logic One step stronger than propositional logic Copyright © Curt Hill.
Predicates and Quantifiers
Discrete Mathematics Mathematical reasoning: think logically; know how to prove Combinatorial analysis: know how to count Discrete structures: represent.
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.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations 1.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 1 Predicates and Quantifiers 1.4.
CSE15 Discrete Mathematics 01/25/17
CSE15 Discrete Mathematics 01/23/17
Chapter 1 – Logic and Proof
Niu Kun Discrete Mathematics Chapter 1 The Foundations: Logic and Proof, Sets, and Functions Niu Kun 离散数学.
Nested Quantifiers Goals: Explain how to work with nested quantifiers
Chapter 1 The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
1.4 Predicates and Quantifiers
CSE 311 Foundations of Computing I
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.
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
ICS 253: Discrete Structures I
Predicates and Quantifiers
The Foundations: Logic and Proofs
Presentation transcript:

Chapter 1: The Foundations: Logic and Proofs 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Predicates and Quantifiers 1.4 Nested Quantifiers 1.5 Rules of Inference 1.6 Introduction to Proofs 1.7 Proof Methods and Strategy

Introduction: Nested Quantifiers Nested quantifiers: Two quantifiers are nested if one is within the scope of the other. Example:  x  y(x+y=0)

Introduction: Nested Quantifiers Example: Domain: real number. Addition inverse:  x  y(x+y=0) Commutative law for addition:  x  y(x+y=y+x) Associative law for addition:  x  y  z (x+(y+z)=(x+y)+z)

The Order of Quantifiers Example: Let Q(x,y) denote “x+y=0.” What are the truth values of the quantifications  y  xQ(x,y) and  x  yQ(x,y), where the domain for all variables consists of all real numbers?

Translating Mathematical Statements into Statements Involving Nested Quantifiers Example 7: Translate the statement “Every real umber except zero has a multiplicative inverse.” (A multiplicative inverse of a real number x is a real number y such that xy=1) HW: Example 8, p54

Translating from Nested Quantifiers into English Example 9: Translate the statement  x(C(x)  y(C(y)  F(x,y))) into English, where C(x) is “x has a computer,” F(x,y) is “x and y are friends,” and the domain for both x and y consists of all students in your school. HW: Example 10, p55.

Negating Nested Quantifiers Example 14: Express the statement  x  y(xy=1) negation of the statement so that no negation precedes a quantifier. HW: Example 15, p57