Uniqueness Quantifier ROI for Quantified Statement.

Slides:



Advertisements
Similar presentations
-- in other words, logic is
Advertisements

Rules of Inference Rosen 1.5.
The Foundations: Logic and Proofs
Predicates and Quantifiers
CSE115/ENGR160 Discrete Mathematics 01/26/12 Ming-Hsuan Yang UC Merced 1.
Valid Arguments An argument is a sequence of propositions. All but the final proposition are called premises. The last statement is the conclusion. The.
The Foundations: Logic and Proofs
Discrete Maths 4. Proofs Objectives
Knowledge Representation Methods
Proofs in Predicate Logic A rule of inference applies only if the main operator of the line is the right main operator. So if the line is a simple statement,
CS128 – Discrete Mathematics for Computer Science
22C:19 Discrete Structures Logic and Proof Spring 2014 Sukumar Ghosh.
1 Discrete Structures CS Johnnie Baker Comments on Early Term Test.
So far we have learned about:
First Order Logic (chapter 2 of the book) Lecture 3: Sep 14.
Discrete Structures Chapter 3: The Logic of Quantified Statements
EE1J2 – Discrete Maths Lecture 5 Analysis of arguments (continued) More example proofs Formalisation of arguments in natural language Proof by contradiction.
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
Predicates and Quantifiers
CS 2210 (22C:019) Discrete Structures Logic and Proof Spring 2015 Sukumar Ghosh.
CSCI2110 – Discrete Mathematics Tutorial 9 First Order Logic Wong Chung Hoi (Hollis)
Chapter 1: The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
(CSC 102) Lecture 7 Discrete Structures. Previous Lectures Summary Predicates Set Notation Universal and Existential Statement Translating between formal.
Section 1.5. Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements.
Proofs1 Advanced Discrete Mathematics Jim Skon. Proofs2  Definition: A theorem is a valid logical assertion which can be proved using other theorems.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
Fallacies The proposition [(p  q)  q]  p is not a tautology, because it is false when p is false and q is true. This type of incorrect reasoning is.
Chapter 1, Part II: Predicate Logic With Question/Answer Animations.
(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.
CompSci 102 Discrete Math for Computer Science January 24, 2012 Prof. Rodger Slides modified from Rosen.
1 Introduction to Abstract Mathematics Chapter 2: The Logic of Quantified Statements. Predicate Calculus Instructor: Hayk Melikya 2.3.
Chapter 1, Part III: Proofs With Question/Answer Animations 1.
Rules of Inference Section 1.6. Arguments in Propositional Logic A argument in propositional logic is a sequence of propositions. All but the final proposition.
Module #1 - Logic Based on Rosen, Discrete Mathematics & Its Applications. Prepared by (c) , Michael P. Frank. Modified By Mingwu Chen 1 Module.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Rules of inference.
Chapter 1, Part III: Proofs With Question/Answer Animations 1.
22C:19 Discrete Structures Logic and Proof Fall 2014 Sukumar Ghosh.
1 Section 8.3 Higher-Order Logic A logic is higher-order if it allows predicate names or function names to be quantified or to be arguments of a predicate.
1 Outline Quantifiers and predicates Translation of English sentences Predicate formulas with single variable Predicate formulas involving multiple variables.
Section 1.5 and 1.6 Predicates and Quantifiers. Vocabulary Predicate Domain Universal Quantifier Existential Quantifier Counterexample Free variable Bound.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
Chapter Ten Relational Predicate Logic. 1. Relational Predicates We now broaden our coverage of predicate logic to include relational predicates. This.
Section 1.4. Propositional Functions Propositional functions become propositions (and have truth values) when their variables are each replaced by a value.
1 Section 7.3 Formal Proofs in Predicate Calculus All proof rules for propositional calculus extend to predicate calculus. Example. … k.  x p(x) P k+1.
Chapter 1, Part III: Proofs With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without.
Chapter 1 Logic and proofs
3. The Logic of Quantified Statements Summary
The Foundations: Logic and Proofs
CSE15 Discrete Mathematics 01/30/17
Discrete Mathematics Logic.
Rules of inference for quantifiers
The Foundations: Logic and Proofs
3 Logic The Study of What’s True or False or Somewhere in Between.
CS201: Data Structures and Discrete Mathematics I
First Order Logic Rosen Lecture 3: Sept 11, 12.
CSE 321 Discrete Structures
Discrete Mathematics Logic.
Predicates and Quantifiers
Discrete Mathematics Lecture 4 Logic of Quantified Statements
CS201: Data Structures and Discrete Mathematics I
The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Inference Rules for Quantified Propositions
Rules of inference Section 1.5 Monday, December 02, 2019
Presentation transcript:

Uniqueness Quantifier ROI for Quantified Statement

Uniqueness quantifier ∃ !x P(x) means that there exists one and only one x in the domain such that P(x) is true. ∃ 1x P(x) is an alternative notation for 9!x P(x). This is read as I There is one and only one x such that P(x). I There exists a unique x such that P(x). Example: Let P(x) denote x + 1 = 0 and x are the integers. Then ∃ !x P(x) is true. Example: Let P(x) denote x > 0 and x are the integers. Then ∃ !x P(x) is false.

Handling Quantified Statements Valid arguments for quantified statements are a sequence of statements. Each statement is either a premise or follows from previous statements by rules of inference which include: Rules of Inference for Propositional Logic Rules of Inference for Quantified Statements The rules of inference for quantified statements are introduced in the next several slides.

Universal Instantiation (UI) Example Our domain consists of all dogs and Fido is a dog. “All dogs are cuddly.” “Therefore, Fido is cuddly.”

Universal Generalization (UG) Used often implicitly in Mathematical Proofs.

Existential Instantiation (EI) Example “There is someone who got an A in the course.” “Let’s call her a and say that a got an A”

Existential Generalization (EG) Example :“Michelle got an A in the class.” “Therefore, someone got an A in the class.”

Rules of Inference for quantified statement Example 1: Using the rules of inference, construct a valid argument to show that “John Smith has two legs” is a consequence of the premises: “Every man has two legs.” “John Smith is a man.” Solution: Let M(x) denote “x is a man” and L(x) “ x has two legs” and let John Smith be a member of the domain. Valid Argument:

ROI for quantified statement Example 2: Use the rules of inference to construct a valid argument showing that the conclusion “Someone who passed the first exam has not read the book.” follows from the premises “A student in this class has not read the book.” “Everyone in this class passed the first exam.” Solution: Let C(x) denote “x is in this class,” B(x) denote “ x has read the book,” and P(x) denote “x passed the first exam.” First we translate the premises and conclusion into symbolic form.

Valid Argument: