Valid and Invalid Arguments

Slides:



Advertisements
Similar presentations
Truth Tables Presented by: Tutorial Services The Math Center.
Advertisements

Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
The Foundations: Logic and Proofs
1 Introduction to Abstract Mathematics Valid AND Invalid Arguments 2.3 Instructor: Hayk Melikya
Logic ChAPTER 3 1. Truth Tables and Validity of Arguments
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
1 Valid and Invalid Arguments CS 202 Epp Section 1.3 Aaron Bloomfield.
Muhammad Arief download dari
Valid Arguments An argument is a sequence of propositions. All but the final proposition are called premises. The last statement is the conclusion. The.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
CS128 – Discrete Mathematics for Computer Science
Chapter 1 The Logic of Compound Statements. Section 1.2 – 1.3 (Modus Tollens) Conditional and Valid & Invalid Arguments.
Discrete Mathematics Lecture 1 Logic of Compound Statements Harper Langston New York University.
Discrete Structures Chapter 1 Part A Fundamentals of Logic Nurul Amelina Nasharuddin Multimedia Department 1.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
Logic Deduction System Casey Schu Write a program to make deductions using first order predicate logic.
Propositional Logic USEM 40a Spring 2006 James Pustejovsky.
Proof by Deduction. Deductions and Formal Proofs A deduction is a sequence of logic statements, each of which is known or assumed to be true A formal.
Through the Looking Glass, 1865
Introduction to Logic Logical Form: general rules
Propositional Logic Lecture 2: Sep 9. Conditional Statement If p then q p is called the hypothesis; q is called the conclusion “If your GPA is 4.0, then.
EE1J2 – Discrete Maths Lecture 4 Analysis of arguments Logical consequence Rules of deduction Rules of equivalence Formal proof of arguments See: Anderson,
Harper Langston New York University Summer 2015
TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.
Validity: Long and short truth tables Sign In! Week 10! Homework Due Review: MP,MT,CA Validity: Long truth tables Short truth table method Evaluations!
1.5 Rules of Inference.
Propositional Logic.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
3.6 Analyzing Arguments with Truth Tables
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
MATERI II PROPOSISI. 2 Tautology and Contradiction Definition A tautology is a statement form that is always true. A statement whose form is a tautology.
Deduction, Proofs, and Inference Rules. Let’s Review What we Know Take a look at your handout and see if you have any questions You should know how to.
Valid and Invalid Arguments
2. The Logic of Compound Statements
Chapter 2 The Logic of Quantified Statements. Section 2.4 Arguments with Quantified Statements.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
Arguments with Quantified Statements M Universal Instantiation If some property is true for everything in a domain, then it is true of any particular.
Chapter 3: Introduction to Logic. Logic Main goal: use logic to analyze arguments (claims) to see if they are valid or invalid. This is useful for math.
MLS 570 Critical Thinking Reading Notes for Fogelin: Propositional Logic Fall Term 2006 North Central College.
Philosophical Method  Logic: A Calculus For Good Reason  Clarification, Not Obfuscation  Distinctions and Disambiguation  Examples and Counterexamples.
LOGIC.
Rules of Inference Dr. Yasir Ali.
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.
Week 1 - Wednesday.  Course overview  Propositional logic  Truth tables  AND, OR, NOT  Logical equivalence.
Copyright © Cengage Learning. All rights reserved.
Dilemma: Division Into Cases Dilemma: p  q p  r q  r  r Premises:x is positive or x is negative. If x is positive, then x 2 is positive. If x is negative,
Logic: The Language of Philosophy. What is Logic? Logic is the study of argumentation o In Philosophy, there are no right or wrong opinions, but there.
Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.
Chapter 1 Logic and proofs
Discrete Mathematics Lecture 2 Continuing Logic, Quantified Logic, Beginning Proofs Harper Langston New York University Summer 2016.
Harper Langston New York University Summer 2017
Arguments with Quantified Statements
2. The Logic of Compound Statements Summary
Valid and Invalid Arguments
Propositional Logic.
Discrete Mathematics Lecture 1 Logic of Compound Statements
Discrete Mathematics Logic of Compound Statements
COMP 1380 Discrete Structures I Thompson Rivers University
Rules of Inference Section 1.6.
Copyright © Cengage Learning. All rights reserved.
Proposition logic and argument CISC2100, Spring 2017 X.Zhang
CS201: Data Structures and Discrete Mathematics I
3.5 Symbolic Arguments.
Inference Rules: Tautologies
The Method of Deduction
COMP 1380 Discrete Structures I Thompson Rivers University
CS201: Data Structures and Discrete Mathematics I
The Foundations: Logic and Proofs
3.5 Symbolic Arguments.
Presentation transcript:

Valid and Invalid Arguments

Argument An argument is a sequence of statements. The final statement is called the conclusion, the others are called the premises.  = “therefore” before the conclusion.

Logical Form If Socrates is a human being, then Socrates is mortal; Socrates is a human being;  Socrates is mortal. If p then q; p; q

Valid Argument An argument form is valid means no matter what particular statements are substituted for the statement variables, if the resulting premises are all true, then the conclusion is also true. An argument is valid if its form is valid.

Test for Validity Identify premises and conclusion Construct a truth table including all premises and conclusion Find rows with premises true (critical rows) If conclusion is true on all critical rows, argument is valid Otherwise argument is invalid

Argument Validity Test Example 1 p  (q  r) ~r  p  q

premises conclusion p q r q  r p(qr) ~r p  q T T T T T F T F T T F F F T T F T F F F T F F F

premises conclusion p q r q  r p(qr) ~r p  q T T T T F T T F T F T T F F F T T F T F F F T F F F

premises conclusion p q r q  r p(qr) ~r p  q T T T T F T T F T F T T F F F T T F T F F F T F F F

Argument Validity Test Example 2 p  q  ~r q  p  r  p  r

premises p q r ~ r q~r pr p r T T T T T F T F T T F F F T T F T F conclusion p q r ~ r q~r pr pq~r qpr p r T T T T T F T F T T F F F T T F T F F F T F F F

premises p q r ~ r q~r pr p r T T T F T T T F T F T T F F F T T conclusion p q r ~ r q~r pr pq~r qpr p r T T T F T T T F T F T T F F F T T F T F F F T F F F

premises p q r ~ r q~r pr p r T T T F T T T F T F T T F F F T T conclusion p q r ~ r q~r pr pq~r qpr p r T T T F T T T F T F T T F F F T T F T F F F T F F F

Rules of Inference (Valid Argument Forms) Modus Ponens Modus Tolens Generalization Specialization Elimination Transitivity Division into Cases Rule of Contradiction

Modus Ponens If p then q; p;  q

Modus Ponens premises conclusion p q pq p q T T T F F T F F

Modus Ponens premises conclusion p q pq p q T T T T F F F T F F

Modus Ponens premises conclusion p q pq p q T T T T F F F T F F

Modus Ponens Example If the last digit of this number is 0, then the number is divisible by 10. The last digit of this number is a 0.  This number is divisible by 10.

Modus Tollens If p then q; ~q;  ~p

Modus Tollens premises conclusion p q pq ~q ~p T T T F F T F F

Modus Tollens premises conclusion p q pq ~q ~p T T T F T F F T F F

Modus Tollens premises conclusion p q pq ~q ~p T T T F T F F T F F

Modus Tollens Example If Zeus is human, then Zeus is mortal. Zeus is not mortal.  Zeus is not human Modus tollens uses the contrapositive.

Generalization p  pq q  pq

Specialization pq  p pq  q

Elimination pq ~q  p p  q ~p  q

Transitivity pq qr pr

Division into Cases pq pr qr r

Division into Cases Example x>1 or x<-1 If x>1 then x2>1 If x<-1 then x2>1  x2>1

Valid Inference Example Statements a, b, c. a. If my glasses are on the kitchen table, then I saw them at breakfast. b. I was reading the newspaper in the living room or I was reading the newspaper in the kitchen. c. If I was reading the newspaper in the living room, then my glasses are on the coffee table.

Valid Inference Example Statements a, b, c. a. If my glasses are on the kitchen table, then I saw them at breakfast. b. I was reading the newspaper in the living room or I was reading the newspaper in the kitchen. c. If I was reading the newspaper in the living room, then my glasses are on the coffee table.

Valid Inference Example Symbols p, q, r, s, t. p = My glasses are on the kitchen table. q = I saw my glasses at breakfast. r = I was reading the newspaper in the living room s = I was reading the newspaper in the kitchen. t = My glasses are on the coffee table.

Statements a, b, c in Symbols a. p  q b. r  s c. r  t

Valid Inference Example Statements d, e, f. d. I did not see my glasses at breakfast. e. If I was reading my book in bed, then my glasses are on the bed table. f. If I was reading the newspaper in the kitchen, then my glasses are on the kitchen table.

Valid Inference Example Statements d, e, f. d. I did not see my glasses at breakfast. e. If I was reading my book in bed, then my glasses are on the bed table. f. If I was reading the newspaper in the kitchen, then my glasses are on the kitchen table.

Valid Inference Example Symbols u, v. u =I was reading my book in bed. v = My glasses are on the bed table.

Statements d, e, f in Symbols d. ~q e. u  v f. s  p

Inference Example Givens a. p  q b. r  s c. r  t d. ~q e. u  v f. s  p

Deduction Sequence 1. p  q from ( ) ~q from ( )  ~p by __________ 2. s  p from ( ) ~p from ( )  ~s by__________

Deduction Sequence 1. p  q from (a) ~q from (d)  ~p by modus tollens 2. s  p from (f) ~p from (1)  ~s by modus tollens

Deduction Sequence 3. r  s from ( ) ~s from ( )  r by_____________ 4. r  t from ( ) r from ( )  t by_____________

Deduction Sequence 3. r  s from (b) ~s from (2)  r by disjunctive syllogism 4. r  t from (c) r from (3)  t by modus ponens

Errors in Reasoning Using vague or ambiguous premises. Circular reasoning Jumping to conclusions Converse error Inverse error

Converse Error If Zeke is a cheater, then Zeke sits in the back row. Zeke sits in the back row.  Zeke is a cheater. pq q  p

Inverse Error If interest rates are going up, then stock market prices will go down. Interest rates are not going up  Stock market prices will not go down. pq ~p  ~q

Inverse Error If I intend to sell my house, then I will need a permit for this wall. I do not intend to sell my house.  I do not need a permit for this wall. pq ~p  ~q

Validity vs. Truth Valid arguments can have false conclusions if one of the premises is false. Invalid arguments can have true conclusions.

Valid but False If John Lennon was a rock star then John Lennon had red hair. John Lennon was a rock star.  John Lennon had red hair.

Invalid but True If New York is a big city, then New York has tall buildings. New York has tall buildings.  New York is a big city.

Contradiction Rule If the supposition that p is false leads to a contradiction then p is true. ~p  c, where c is a contradiction.  p

Contradiction Rule If the supposition that p is false leads to a contradiction then p is true. ~p  c, where c is a contradiction.  p premise conclusion p ~p c ~pc T F

Rule of Contradiction Example Knights tell the truth, Knaves lie. A says: “B is a knight.” B says: “A and I are opposite types.” What are A and B? (Hint: Suppose A is a Knight.)

Rules of Inference (Valid Argument Forms) Modus Ponens Modus Tolens Disjunctive Addition Conjunctive Simplification Disjunctive Syllogism Hypothetical Syllogism Division into Cases Rule of Contradiction