CSE 321 Discrete Structures

Slides:



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

Rules of Inference Rosen 1.5.
The Foundations: Logic and Proofs
Muhammad Arief download dari
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
CSE 311 Foundations of Computing I Lecture 6 Predicate Logic Autumn 2011 CSE 3111.
Predicates and Quantifiers
CS 2210 (22C:019) Discrete Structures Logic and Proof Spring 2015 Sukumar Ghosh.
CSE 311 Foundations of Computing I Lecture 6 Predicate Logic, Logical Inference Spring
CSCI2110 – Discrete Mathematics Tutorial 9 First Order Logic Wong Chung Hoi (Hollis)
CS 103 Discrete Structures Lecture 07b
1 Basic Proof Methods I Basic Proof Methods II Proofs Involving Quantifiers.
Section 1.5. Section Summary Nested Quantifiers Order of Quantifiers Translating from Nested Quantifiers into English Translating Mathematical Statements.
Discrete Structures (DS)
CSE 311 Foundations of Computing I Lecture 5 Predicate Logic Spring
CSE 311 Foundations of Computing I Lecture 7 Logical Inference Autumn 2012 CSE
2.8 Methods of Proof PHIL 012 1/26/2001.
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.
CompSci 102 Discrete Math for Computer Science January 24, 2012 Prof. Rodger Slides modified from Rosen.
CSE 321 Discrete Structures Winter 2008 Lecture 5 Rules of Inference.
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.
Chapter 7. Propositional and Predicate Logic Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
CSci 2011 Discrete Mathematics Lecture 4 CSci 2011.
321 Section, Week 2 Natalie Linnell. Extra Credit problem.
Chapter 1, Part III: Proofs With Question/Answer Animations Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without.
Uniqueness Quantifier ROI for Quantified Statement.
Lecture 4 Logic and Proof. Plan of lecture Predicate logic Relations between quantifiers Proof 2.
CS 2210:0001 Discrete Structures Logic and Proof
Chapter 7. Propositional and Predicate Logic
The Foundations: Logic and Proofs
CSE15 Discrete Mathematics 01/30/17
Discrete Mathematics Logic.
Discrete Mathematics.
Applied Discrete Mathematics Week 5: Mathematical Reasoning
Propositions and Logical Operations
Chapter 1, Section 1.1 Propositional Logic
CSE 311 Foundations of Computing I
Proof Techniques.
The Foundations: Logic and Proofs
CS201: Data Structures and Discrete Mathematics I
CS100: Discrete structures
CSE 311 Foundations of Computing I
Methods of Proof. Methods of Proof Definitions A theorem is a valid logical assertion which can be proved using Axioms: statements which are given.
CSE 311: Foundations of Computing
CS 103 Discrete Structures
Negations of quantifiers
Discrete Mathematics Logic.
Information Technology Department SKN-SITS,Lonavala.
Chapter 7. Propositional and Predicate Logic
Discrete Mathematics Lecture 4 & 5: Predicate and Quantifier
Predicates and Quantifiers
CS201: Data Structures and Discrete Mathematics I
Logic of Informatics Rule of Inference.
Valid and Invalid Arguments
The Foundations: Logic and Proofs
CSE 311: Foundations of Computing
The Foundations: Logic and Proofs
CSE 321 Discrete Structures
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.
Rules of inference Section 1.5 Monday, December 02, 2019
Presentation transcript:

CSE 321 Discrete Structures Winter 2008 Lecture 5 Rules of Inference

Announcements Reading for this week Homework 2 January 21, No class Today: 1.5 Friday: 1.6 Homework 2 Due Wednesday, January 23 January 21, No class

Highlights from Lecture 4 Translation between Predicate Calculus and English “Red cats like tofu”  x ((Cat(x)  Red(x))  LikesTofu(x))  x (Cat(x)  (Red(x)  LikesTofu(x))) Nested Quantifiers

Quantification with two variables Expression When true When false  x  y P(x,y)  x  y P(x,y)  x  y P(x, y)  y  x P(x, y)

Valid Arguments Classical logic Artificial Intelligence: Automated Reasoning

Reasoning “If Seattle won last Saturday they would be in the playoffs” “Seattle is not in the playoffs” Therefore . . .

Proofs Start with hypotheses and facts Use rules of inference to extend set of facts Result is proved when it is included in the set

Rules of Inference p p  q  q  q p  q   p p  q q  r  p  r  x P(x)  P(c) P(c) for any c   xP(x)  x P(x)  P(c) for some c P(c) for some c   x P(x)

Example 6 Hypotheses Show: p: sunny this afternoon q: colder than yesterday r: we will go swimming s: take a canoe trip t: home by sunset Example 6 Hypotheses It is not sunny this afternoon and it is colder than yesterday We will go swimming only if it is sunny If we do not go swimming, then we will take a canoe trip If we take a canoe trip, we will be home by sunset Show: We will be home by sunset  p  q r  p  r  s s t

Classical Logic All men are mortal Socrates is a man Therefore, Socrates is mortal

Example 13 Show “A student in this class has not read the book”, and “Everyone in this class passed the exam” imply “Someone who passed the exam has not read the book” C(x): x is in the class B(x): x has read the book P(x): x passed the exam  x(C(x)  B(x)) C(a)  B(a) C(a)  x (C(x) P(x)) C(a) P(a) P(a)  B(a) P(a)  B(a)  x(P(x)  B(x)) Premises:  x(C(x)  B(x))  x(C(x) P(x)) Conclusion  x(P(x) B(x))