A Quick Look at Quantified Statements. Why are Quantified Statements Important? The logical structure of quantified statements provides a basis for the.

Slides:



Advertisements
Similar presentations
Tutorial 2: First Order Logic and Methods of Proofs
Advertisements

PROOF BY CONTRADICTION
The Logic of Quantified Statements
AB 11 22 33 44 55 66 77 88 99 10  20  19  18  17  16  15  14  13  12  11  21  22  23  24  25  26  27  28.
1 CSE 20: Lecture 8 Boolean Postulates and Theorems CK Cheng 4/26/2011.
Nested Quantifiers Goals: Explain how to work with nested quantifiers
Inductive and Deductive Reasoning Geometry 1.0 – Students demonstrate understanding by identifying and giving examples of inductive and deductive reasoning.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
2.5 Reasoning in Algebra and Geometry
Proof of Pythagoras’s Theorem GCSE Higher. ‘Prove’ means what exactly? A proof in mathematics is a process of logical steps Each step makes a statement.
Adapted from Discrete Math
Algorithm Design and Analysis (ADA)
Computer Science 101 The Boolean System. George Boole British mathematician ( ) Boolean algebra –Logic –Set theory –Circuits –Conditions in if.
Copyright © Curt Hill Truth Tables A way to show Boolean Operations.
Discrete Maths Objective to introduce mathematical induction through examples , Semester 2, Mathematical Induction 1.
CS 173, Lecture B September 1, 2015 Tandy Warnow.
Section 5.3. Section Summary Recursively Defined Functions Recursively Defined Sets and Structures Structural Induction.
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
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.
9.4 Mathematical Induction
Chap 3 –A theorem is a statement that can be shown to be true –A proof is a sequence of statements to show that a theorem is true –Axioms: statements which.
Logic and Reasoning Conditional Statements. Logic The use and study of valid reasoning. When studying mathematics it is important to have the ability.
Thinking Mathematically
1 Discrete Structures – CNS2300 Text Discrete Mathematics and Its Applications Kenneth H. Rosen (5 th Edition) Chapter 3 The Foundations: Logic and Proof,
Sets 2/10/121. What is a Set? Informally, a collection of objects, determined by its members, treated as a single mathematical object Not a real definition:
Thinking Mathematically Statements, Negations, and Quantified Statements.
October 3, 2001CSE 373, Autumn Mathematical Background Exponents X A X B = X A+B X A / X B = X A-B (X A ) B = X AB X N +X N = 2X N 2 N +2 N = 2 N+1.
Laws of Boolean Algebra Commutative Law Associative Law Distributive Law Identity Law De Morgan's Theorem.
Do Now: Write the converse of the Polygon Congruence Postulate and give an example. Do you think the converse is true? CPCTC.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
Chapter 5 With Question/Answer Animations 1. Chapter Summary Mathematical Induction - Sec 5.1 Strong Induction and Well-Ordering - Sec 5.2 Lecture 18.
Uniqueness Quantifier ROI for Quantified Statement.
Mathematical Induction. The Principle of Mathematical Induction Let S n be a statement involving the positive integer n. If 1.S 1 is true, and 2.the truth.
Introduction to Logic © 2008 Pearson Addison-Wesley.
11.7 – Proof by Mathematical Induction
CS 2210:0001 Discrete Structures Logic and Proof
The arrow points to the smaller of the two numbers
6-2 Substitution Again Goals: Solve linear systems using substitution
Thinking Mathematically
Truth Tables and Equivalent Statements
Nested Quantifiers Goals: Explain how to work with nested quantifiers
How do you compare and use the properties of real numbers?
Elementary Properties of Groups
An indirect proof uses a temporary assumption that
The Foundations: Logic and Proofs
2-1 Conditional Statements
Decidability of logical theories
Mathematics for Computer Science MIT 6.042J/18.062J
Follow me for a walk through...
Introduction to Predicates and Quantified Statements II
Chapter 1 Logic and Proof.
(1.4) An Introduction to Logic
Copyright © Cengage Learning. All rights reserved.
Applied Discrete Mathematics Week 9: Integer Properties
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Mathematical Induction
Follow me for a walk through...
Decidability of logical theories
Section 3.3 Truth Tables for the Conditional and Biconditional
Copyright © Cengage Learning. All rights reserved.
6-2 Substitution Again Goals: Solve linear systems using substitution
2.4 Mathematical Induction
Introduction to Proofs
© T Madas.
Follow me for a walk through...
Introduction to Proofs
True or False True or False
11.4 Mathematical Induction
Presentation transcript:

A Quick Look at Quantified Statements

Why are Quantified Statements Important? The logical structure of quantified statements provides a basis for the construction and validation of proofs.

Consider the quantified statements… “For every positive number b, there exists a positive number a such that a<b. “There exists a positive number a such that for every positive number b, a<b.” Are the statements true or false?

A mathematical interpretation of a quantified statement relies on the quantified structure of the statement. By convention, a quantified statement is interpreted as it is written from left to right.

Mathematical Convention for Interpreting Statements “for all… there exists…” (AE) {b 0, b 1, b 2, b 3, b 4, …} {a 0, a 1, a 2, a 3, a 4, …}

Mathematical Convention for Interpreting Statements “there exists… for all…” (EA) {b 0, b 1, b 2, b 3, b 4, …} {a 0, a 1, a 2, a 3, a 4, …}

Consider the quantified statements… “For every positive number b, there exists a positive number a such that a<b. The statement is true. For any positive number b, we can find a positive number a less than it; for instance, let a=b/2. “There exists a positive number a such that for every positive number b, a<b.” The statement is false. There is no positive number a smaller than every other positive number b; for instance, let b=a/2