Review. p q ~p v q Contrapositive: ~q ~p Inverse: ~p ~q Converse: q p

Similar documents
[Ch 3, 4] Logic and Proofs (2) 1. Valid and Invalid Arguments ( 2.3, 3.4) 400 lecture note #2. 1) Basics

KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) RULES OF INFERENCE. Discrete Math Team

The Logic of Compound Statements. CSE 2353 Discrete Computational Structures Spring 2018

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

Rules of Inference. Agenda. Rules of Inference Dr Patrick Chan. p r. p q. q r. Rules of Inference for Quantifiers. Hypothetical Syllogism

Sec$on Summary. Valid Arguments Inference Rules for Propositional Logic. Inference Rules for Quantified Statements. Building Arguments

Discrete Structures of Computer Science Propositional Logic III Rules of Inference

Review. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions

Chapter 1, Logic and Proofs (3) 1.6. Rules of Inference

Rules Build Arguments Rules Building Arguments

Rules of Inference. Arguments and Validity

Why Proofs? Proof Techniques. Theorems. Other True Things. Proper Proof Technique. How To Construct A Proof. By Chuck Cusack

Methods of Proof. 1.6 Rules of Inference. Argument and inference 12/8/2015. CSE2023 Discrete Computational Structures

CSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

CS 2740 Knowledge Representation. Lecture 4. Propositional logic. CS 2740 Knowledge Representation. Administration

CS 2336 Discrete Mathematics

Sec$on Summary. Valid Arguments Inference Rules for Propositional Logic. Inference Rules for Quantified Statements. Building Arguments

CS0441 Discrete Structures Recitation 3. Xiang Xiao

Review: Potential stumbling blocks

DISCRETE MATH: LECTURE 6

Propositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013

3 Rules of Inferential Logic

Discrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University

Resolution (7A) Young Won Lim 4/21/18

The Logic of Compound Statements cont.

Boolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012

software design & management Gachon University Chulyun Kim

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

THE LOGIC OF COMPOUND STATEMENTS

Knowledge Representation. Propositional logic

What is the decimal (base 10) representation of the binary number ? Show your work and place your final answer in the box.

Intro to Logic and Proofs

Knowledge Representation. Propositional logic.

DISCRETE MATH: FINAL REVIEW

A Quick Lesson on Negation

DISCRETE MATH: LECTURE 3

PSU MATH RELAYS LOGIC & SET THEORY 2017

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

Analyzing Arguments with Truth Tables

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference

CSE 20 DISCRETE MATH. Winter

Discrete Mathematics Recitation Course 張玟翔

A. Propositional Logic

Mathacle. PSet ---- Algebra, Logic. Level Number Name: Date: I. BASICS OF PROPOSITIONAL LOGIC

MACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)

Section 1.3: Valid and Invalid Arguments

The Foundations: Logic and Proofs. Chapter 1, Part III: Proofs

Why Learning Logic? Logic. Propositional Logic. Compound Propositions

Proposition logic and argument. CISC2100, Spring 2017 X.Zhang

Where are my glasses?

Math.3336: Discrete Mathematics. Nested Quantifiers/Rules of Inference

Proofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.

Propositional Logic. Jason Filippou UMCP. ason Filippou UMCP) Propositional Logic / 38

With Question/Answer Animations. Chapter 1, Part III: Proofs

Discrete Mathematics

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.

Proving Things. Why prove things? Proof by Substitution, within Logic. Rules of Inference: applying Logic. Using Assumptions.

1 The Foundation: Logic and Proofs

Agenda. Introduction to Proofs Dr Patrick Chan School of Computer Science and Engineering South China University of Technology

Simplification by Truth Table and without Truth Table

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

Outline. Rules of Inferences Discrete Mathematics I MATH/COSC 1056E. Example: Existence of Superman. Outline

Anna University, Chennai, November/December 2012

CSE 20 DISCRETE MATH. Fall

Valid Reasoning. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, Outline Truth and Validity Valid Reasoning

Deductive and Inductive Logic

Tutorial Obtain the principal disjunctive normal form and principal conjunction form of the statement

Proof Tactics, Strategies and Derived Rules. CS 270 Math Foundations of CS Jeremy Johnson

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)

Simplification by Truth Table and without Truth Table

1 The Foundation: Logic and Proofs

PHI Propositional Logic Lecture 2. Truth Tables

(Refer Slide Time: 02:20)

Chapter 1: The Logic of Compound Statements. January 7, 2008

CSC 125 :: Final Exam December 14, 2011

PROPOSITIONAL CALCULUS

Argument. whenever all the assumptions are true, then the conclusion is true. If today is Wednesday, then yesterday is Tuesday. Today is Wednesday.

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

Propositional Logic. Fall () Propositional Logic Fall / 30

Predicate Logic & Quantification

CSC 125 :: Final Exam May 3 & 5, 2010

Test 1 Solutions(COT3100) (1) Prove that the following Absorption Law is correct. I.e, prove this is a tautology:

Readings: Conjecture. Theorem. Rosen Section 1.5

Discrete Structures & Algorithms. Propositional Logic EECE 320 // UBC

Propositional Logic. Spring Propositional Logic Spring / 32

Boolean Logic. CS 231 Dianna Xu

Inference in Propositional Logic

DISCRETE MATH: LECTURE Chapter 3.3 Statements with Multiple Quantifiers If you want to establish the truth of a statement of the form

1) Let h = John is healthy, w = John is wealthy and s = John is wise Write the following statement is symbolic form

(ÀB Ä (A Â C)) (A Ä ÀC) Á B. This is our sample argument. Formal Proofs

Solutions to Exercises (Sections )

At least one of us is a knave. What are A and B?

ECOM Discrete Mathematics

Collins' notes on Lemmon's Logic

CPSC 121: Models of Computation

SRI VENKATESWARA COLLEGE OF ENGINEERING AND TECHNOLOGY MA DISCRETE MATHEMATICS

STUDY PROBLEMS FOR EXAM I CMSC 203 DISCRETE STRUCTURES. n (n +1)(2n +1), 6. j 2 = 1(1+1)(2 1+1) 6. k (k +1)(2k +1) 6

Transcription:

~ v Contraositive: ~ ~ Inverse: ~ ~ Converse: Å Review ( Ú ) Ù ~( Ù ) ~( Ù ) ~ Ú ~ ~( Ú ) ~ Ù ~ is sufficient for is necessary for ~ ~ 1

Valid and Invalid Arguments CS 231 Dianna Xu 2

Associative Law: (Ù)Ùr Ù(Ùr) (Ú)Úr Ú(Úr) Distributive Law: Review Ù(Úr) (Ù)Ú(Ùr) Ú(Ùr) (Ú)Ù(Úr) Absortion Law: Ú ( Ù ) Ù ( Ú ) 3

Definitions An argument is a seuence of statements (statement forms). All statements in an argument excet for the last one, are called remises. (assumtions, hyotheses) The final statement is the conclusion. A valid argument means the conclusion is true if the remises are all true, with all combinations of variable truth values. 4

Examles All Greeks are human and all humans are mortal; therefore, all Greeks are mortal. Some men are athletes and some athletes are rich; therefore, some men are rich. Some men are swimmers and some swimmers are fish; therefore, some men are fish. 5

Modus Ponens \ 6

Modus Ponens examle Assume you are given the following two statements: you are in this class If you are in this class, you are a student Let = you are in this class Let = you are a student \ By Modus Ponens, you can conclude that you are a student. 7

Modus Ponens Consider ( Ù ( )) Ù( ) (Ù( )) T T T T T T F F F T F T T F T F F T F T \ 8

Modus Tollens Assume that we know: ~ and Recall that ~ ~ Thus, we know ~ and ~ ~ We can conclude ~ ~ ~ 9

Modus Tollens examle Assume you are given the following two statements: you are not a student if you are in this class, you are a student Let = you are in this class Let = you are a student ~ ~ By Modus Tollens, you can conclude that you are not in this class 10

Generalization & Secialization Generalization: If you know that is true, then Ú will ALWAYS be true \ Ú Secialization: If Ù is true, then will ALWAYS be true \ Ù 11

Examle of roof We have the hyotheses: r s t 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 tri If we take a canoe tri, then we will be home by sunset Does this imly that we will be home by sunset? ~ Ù r ~r s s t t 12

Examle of roof 1. ~ Ù 1 st hyothesis 2. ~ Secialization using ste 1 3. r 2 nd hyothesis 4. ~r Modus tollens using stes 2 & 3 5. ~r s 3 rd hyothesis 6. s Modus onens using stes 4 & 5 7. s t 4 th hyothesis 8. t Modus onens using stes 6 & 7 ~ Ù \ \ ~ 13

More rules of inference Conjunction: if and are true searately, then Ù is true \ Ù Elimination: If Ú is true, and is false, then must be true ~ ~ Transitivity: If is true, and r is true, then r must be true r \ r 14

Even more rules of inference Proof by division into cases: if at least one of or is true, then r must be true Contradiction rule: If ~ c is true, we can conclude (via the contra-ositive) Ú r r \ r ~ c Resolution: If Ú is true, and ~Úr is true, then Úr must be true Not in the textbook ~ r r 15

Examle of roof Given the hyotheses: If it does not rain or if it is not foggy, then the sailing race will be held and the lifesaving demonstration will go on If the sailing race is held, then the trohy will be awarded The trohy was not awarded Can you conclude: It rained? (~r Ú ~f) (s Ù l) s t ~t r 16

Examle of roof 1. ~t 3 rd hyothesis 2. s t 2 nd hyothesis 3. ~s Modus tollens using stes 1 & 2 4. (~rú~f) (sùl) 1 st hyothesis 5. ~(sùl) ~ (~rú~f) Contraositive of ste 4 6. (~sú~l) (rùf) DeMorgan s law and double negation law 7. ~sú~l Generalization using ste 3 8. rùf Modus onens using stes 6 & 7 9. r Secialization using ste 8 \ Ù \ Ú \ ~ ~ 17

Fallacy of the converse Modus Badus Fallacy of affirming the conclusion Consider the following: ~ ~ Is this true? \ Ù( ) (Ù( )) T T T T T T F F F T F T T T F F F T F T Not a valid rule! 18

Modus Badus examle Assume you are given the following two statements: you are a student If you are in this class, you are a student Let = you are in this class Let = you are a student \ It is clearly wrong to conclude that if you are a student, you must be in this class 19

Fallacy of the inverse Modus Badus Fallacy of denying the hyothesis Consider the following: Is this true? ~ ~ ~Ù( )) (~Ù( )) ~ T T T F T T F F F T F T T T F F F T T T Not a valid rule! 20

Modus Badus examle Assume you are given the following two statements: you are not in this class if you are in this class, you are a student Let = you are in this class Let = you are a student ~ ~ You CANNOT conclude that you are not a student just because you are not taking Discrete Math 21