Rules of Inference. Arguments and Validity

Similar documents
Intro to Logic and Proofs

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

CS 2336 Discrete Mathematics

Rules Build Arguments Rules Building Arguments

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

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

Readings: Conjecture. Theorem. Rosen Section 1.5

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

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

Review: Potential stumbling blocks

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

software design & management Gachon University Chulyun Kim

CSCI-2200 FOUNDATIONS OF COMPUTER SCIENCE

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

Logic Overview, I. and T T T T F F F T F F F F

ECOM Discrete Mathematics

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

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

ICS141: Discrete Mathematics for Computer Science I

Discrete Structures for Computer Science

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

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

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

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

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

DISCRETE MATHEMATICS BA202

Analyzing Arguments with Truth Tables

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

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

Predicate Logic. Andreas Klappenecker

PROPOSITIONAL CALCULUS

Predicate Logic & Quantification

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

Chapter 4, Logic using Propositional Calculus Handout

COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University

CSCE 222 Discrete Structures for Computing. Predicate Logic. Dr. Hyunyoung Lee. !!!!! Based on slides by Andreas Klappenecker

Why Learning Logic? Logic. Propositional Logic. Compound Propositions

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

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

1 The Foundation: Logic and Proofs

CSE 20 DISCRETE MATH. Winter

1 The Foundation: Logic and Proofs

CSE 20 DISCRETE MATH. Fall

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

Manual of Logical Style

Proofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction

CS0441 Discrete Structures Recitation 3. Xiang Xiao

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

Proofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007

A. Propositional Logic

Announcements. Exam 1 Review

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

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. Argument Forms. Ioan Despi. University of New England. July 19, 2013

Math 55 Homework 2 solutions

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

Math 3336: Discrete Mathematics Practice Problems for Exam I

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

COMP232 - Mathematics for Computer Science

Solutions to Exercises (Sections )

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

Logic and Proof. Aiichiro Nakano

Discrete Mathematics

Full file at Chapter 1

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

Inference and Proofs (1.6 & 1.7)

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

(Refer Slide Time: 02:20)

Reexam in Discrete Mathematics

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

Logic. Logic is a discipline that studies the principles and methods used in correct reasoning. It includes:

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

PHI Propositional Logic Lecture 2. Truth Tables

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

Unit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics

For a horseshoe statement, having the matching p (left side) gives you the q (right side) by itself. It does NOT work with matching q s.

Mat2345 Week 2. Chap 1.5, 1.6. Fall Mat2345 Week 2. Chap 1.5, 1.6. Week2. Negation. 1.5 Inference. Modus Ponens. Modus Tollens. Rules.

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

Review for Midterm 1. Andreas Klappenecker

Chapter 1 Elementary Logic

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

2. Use quantifiers to express the associative law for multiplication of real numbers.

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

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

The Logic of Compound Statements cont.

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Discrete Mathematics. Propositional & Predicate Logic. Lecture Notes

Collins' notes on Lemmon's Logic

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

A Quick Lesson on Negation

Section 1.2: Propositional Logic

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

Supplementary Logic Notes CSE 321 Winter 2009

Propositional Logic. Spring Propositional Logic Spring / 32

Chapter 2: The Logic of Quantified Statements

CSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!

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

Transcription:

Arguments and Validity A formal argument in propositional logic is a sequence of propositions, starting with a premise or set of premises, and ending in a conclusion. We say that an argument is valid if and only if the conclusion is true when all premises are true. 61

Arguments and Validity Example: 1. If I work, then I get paid. 2. If I get paid, then I pay the bills. 3. Therefore, if I work, then I pay the bills. 62

Argument Form An argument form is a sequence of compound propositions involving propositional variables. An argument form is valid if no matter which particular propositions are substituted for the propositional variables in its premises, the conclusion is true if the premises are all true. Example: Argument 1. If I work, then I get paid. 2. If I get paid, then I pay the bills. 3. Therefore, if I work, then I pay the bills. Argument Form 1. p q 2. q r 3. p r 63

Modus Ponens (Law of Detachment) Example 1. If it snows today, then we will go skiing. 2. It is snowing today. 3. Therefore, we will go skiing. Argument Form p q p q 64

Modus Tollens Example 1. If it snows today, then we will go skiing. 2. We will not go skiing. 3. Therefore, it is not snowing today. Argument Form p q q p 65

Disjunctive syllogism Example 1. It is sunny, or it is cloudy 2. It is not sunny. 3. Therefore, it is cloudy. Argument Form p q p q 67

Addition Example 1. It is sunny. 2. Therefore, it is sunny, or it is cloudy. Argument Form p p q 68

Simplification Example 1. It is cloudy, and it is raining. 2. Therefore, it is cloudy. Argument Form p q p 69

Conjunction Example 1. It is cloudy. 2. It is raining. 3. Therefore, it is cloudy, and it is raining. Argument Form p q p q 70

Resolution Example 1. It s a weekday, or the kids are off of school. 2. It s not a weekday, or Jim is working. 3. Therefore, the kids are off of school, or Jim is working. Argument Form p q p r q r 71

Rule of Inference Tautology Name p p q q (p (p q)) q Modus ponens q p q p p q q r p r p q p q ( q (p q)) p ((p q) (q r)) (p r) ((p q) p) q Modus tollens Hypothetical syllogism Disjunctive syllogism 72

Rule of Inference p p q Tautology p (p q) Name Addition p q p p q p q (p q) p Simplification (p q) (p q) Conjunction p q p r q r ((p q) ( p r) (q r) Resolution 73

Examples: of inference used. In each case identify the rule If it is cloudy, then it s raining. It s not raining. Therefore, it s not cloudy. If it rains today, then we will not have a barbecue today. If we do not have a barbecue today, then we will have a barbecue tomorrow. Therefore, if it rains today, then we will have a barbecue tomorrow. 74

Examples: of inference used. In each case identify the rule It is below freezing now. Therefore, it is either below freezing or raining now. It is below freezing and raining now. Therefore, it is below freezing now. Jasmine is skiing, or it is not snowing. It is snowing, or Bart is playing hockey. Jasmine is skiing, or Bart is playing hockey. 75

Examples: If you do every problem in this book, then you will learn discrete mathematics. You learned discrete mathematics. Therefore, you did every problem in this book. If you do every problem in this book, then you will learn discrete mathematics. You did not do every problem in this book. Therefore, you did not learn discrete mathematics. 76

Common Fallacies Fallacy p q q p p q p q Name Affirming the conclusion Denying the hypothesis 77

Constructing Arguments Example: For the given set of premises, what conclusion can be drawn? 1. It is not sunny today, and it is colder than yesterday. 2. We will go swimming only if it is sunny. 3. If we do not go swimming, then we will take a canoe trip. 4. If we take a canoe trip, then we will be home by sunset. Conclusion: 78

Constructing Arguments Premises 1. It is not sunny today, and it is colder than yesterday. ( p q) 2. We will go swimming only if it is sunny. (r p) 3. If we do not go swimming, then we will take a canoe trip. ( r s) 4. If we take a canoe trip, then we will be home by sunset. (s t) Conclusion We will be home by sunset. (t) Argument Statement 1. p q 2. p 3. r p 4. r 5. r s 6. s 7. s t 8. t Reason Premise Simplification (1) Premise Modus tollens (2 and 3) Premise Modus ponens (4 and 5) Premise Modus ponens (6 and 7) 79

Constructing Arguments Premises 1. If you send me an e-mail, then I will finish the project. (p q) 2. If you do not send me an e-mail, then I will go home. ( p r) 3. If I go home, then I will go to sleep early. (r s) Conclusion If I do not finish the project, then I will go to sleep early. ( q s) Argument Statement 1. p q 2. q p 3. p r 4. q r 5. r s 6. q s Reason Premise Contrapositive (1) Premise Hypothetical syllogism (2 and 3) Premise Hypothetical syllogism (4 and 5) 80

and Quantifiers Rule of Inference x P (x) P (c) for an arbitrary c P (c) for an arbitrary c x P (x) x P (x) P (c) for some element c P (c) for some element c x P (x) Name Universal instantiation Universal generalization Existential instantiation Existential generalization

and Quantifiers Premises 1. Everyone taking discrete math has taken calculus. ( x(d(x) C(x))) 2. Marla is taking discrete math class. (D(M arla)) Conclusion Marla has taken calculus. (C(M arla)) Argument Statement 1. x(d(x) C(x)) 2. D(Marla) C(Marla) 3. D(Marla) 4. C(Marla) Reason Premise Universal instantiation (1) Premise Modus ponens (2 and 3)

and Quantifiers Premises 1. A student in this class has not read the book. ( x(c(x) B(x))) 2. Everyone in this class passed the first exam. ( x(c(x) P (x))) Conclusion Someone who passed the first exam has not read the book. Argument ( x(p (x) B(x))) Statement 1. x(c(x) B(x)) 2. C(a) B(a) 3. C(a) 4. x(c(x) P (x)) 5. C(a) P (a) 6. P (a) 7. B(a) 8. P (a) B(a) 9. x(p (x) B(x)) Reason Premise Existential instantiation (1) Simplification (2) Premise Universal instantiation (4) Modus ponens (3 and 5) Simplification (2) Conjunction (6 and 7) Existential generalization (8)