Arguments in Sentential Logic

Slides:



Advertisements
Similar presentations
Truth Tables The aim of this tutorial is to help you learn to construct truth tables and use them to test the validity of arguments. Go To Next Slide.
Advertisements

Truth Functional Logic
Logic & Critical Reasoning
Higher / Int.2 Philosophy 5. ” All are lunatics, but he who can analyze his delusion is called a philosopher.” Ambrose Bierce “ Those who lack the courage.
Semantics of SL and Review Part 1: What you need to know for test 2 Part 2: The structure of definitions of truth functional notions Part 3: Rules when.
Euler’s circles Some A are not B. All B are C. Some A are not C. Algorithm = a method of solution guaranteed to give the right answer.
Use a truth table to determine the validity or invalidity of this argument. First, translate into standard form “Martin is not buying a new car, since.
Chapter 1 The Logic of Compound Statements. Section 1.3 Valid & Invalid Arguments.
CS128 – Discrete Mathematics for Computer Science
DEDUCTIVE REASONING: PROPOSITIONAL LOGIC Purposes: To analyze complex claims and deductive argument forms To determine what arguments are valid or not.
Essential Deduction Techniques of Constructing Formal Expressions and Evaluating Attempts to Create Valid Arguments.
Today’s Topics n Review Logical Implication & Truth Table Tests for Validity n Truth Value Analysis n Short Form Validity Tests n Consistency and validity.
For Monday, read Chapter 4, Sections 1 and 2. Nongraded homework: Problems on pages Graded HW #4 is due on Friday, Feb. 11, at the beginning of.
Essential Deduction Techniques of Constructing Formal Expressions Evaluating Attempts to Create Valid Arguments.
Through the Looking Glass, 1865
Copyright © 2005 Pearson Education, Inc. Slide 1-1.
Critical Thinking: A User’s Manual
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!
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Chapter Three Truth Tables 1. Computing Truth-Values We can use truth tables to determine the truth-value of any compound sentence containing one of.
Chapter 3: MAKING SENSE OF ARGUMENTS
INTRODUCTION TO LOGIC Jennifer Wang Fall 2009 Midterm Review Quiz Game.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.
1 DISJUNCTIVE AND HYPOTHETICAL SYLLOGISMS DISJUNCTIVE PROPOSITIONS: E.G EITHER WHALES ARE MAMMALS OR THEY ARE VERY LARGE FISH. DISJUNCTS: WHALES ARE MAMMALS.(P)
2.8 Methods of Proof PHIL 012 1/26/2001.
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.
Chapter 7 Evaluating Deductive Arguments II: Truth Functional Logic Invitation to Critical Thinking First Canadian Edition.
Essential Deduction Techniques of Constructing Formal Expressions Evaluating Attempts to Create Valid Arguments.
Invitation to Critical Thinking Chapter 7 Lecture Notes Chapter 7.
Today’s Topics Argument forms and rules (review)
1 Propositional Proofs 1. Problem 2 Deduction In deduction, the conclusion is true whenever the premises are true.  Premise: p Conclusion: (p ∨ q) 
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
March 23 rd. Four Additional Rules of Inference  Constructive Dilemma (CD): (p  q) (r  s) p v r q v s.
Chapter 7. Propositional and Predicate Logic
2. The Logic of Compound Statements Summary
Discrete Mathematics Lecture 1 Logic of Compound Statements
CSE15 Discrete Mathematics 01/30/17
COMP 1380 Discrete Structures I Thompson Rivers University
Deductive Arguments.
Introduction to Logic Lecture 14 The truth functional argument
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
{P} ⊦ Q if and only if {P} ╞ Q
Copyright © Cengage Learning. All rights reserved.
6.1 Symbols and Translation
Methods for Evaluating Validity
Chapter 8 Logic Topics
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
2 Chapter Introduction to Logic and Sets
7.1 Rules of Implication I Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.
3.5 Symbolic Arguments.
Hurley … Chapter 6.5 Indirect Truth Tables
Logical Forms.
Natural Deduction.
Applied Discrete Mathematics Week 1: Logic
Propositional Logic.
The Method of Deduction
1 Chapter An Introduction to Problem Solving
Discrete Mathematics Lecture 2: Propositional Logic
1 Chapter An Introduction to Problem Solving
Chapter 7. Propositional and Predicate Logic
From Informal Fallacies to Formal Logic
Introductory Logic PHI 120
COMP 1380 Discrete Structures I Thompson Rivers University
Truth Tables for the Conditional and Biconditional
Philosophy 1100 Class #9 Title: Critical Reasoning
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Validity and Soundness, Again
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
Conjunctive addition states that if we know that each of two statements is true, we can join them with the conjunction connective and the resulting conjunction.
Presentation transcript:

Arguments in Sentential Logic Sign In! Review Validity Modus Ponens Modus Tollens Chain Arguments For Next Time: Read Chapter 9 pages 317-328 Ch. 9 Homework #1: (9-1): 1,2,3; (9-2): 1,3,8,12,15,20; (9-3): construct only 3 truth tables

Fake Quiz! When is the following sentence false? “If you watch Night of the Living Dead then you will be scared.”

Fake Quiz! How would you translate the following sentence into standard sentential logical notation? Make sure to replace claims with claim variables and logical connectives for indicator terms “If you are having a difficult time with logic then either you should come to office hours or you should ask me questions via e-mail”

Fake Quiz! How should translate the following sentence into sentential logical notation? “If we eat turkey then, unless the turkey is small, we will be full”

Fake Quiz! Construct a truth table for the following sentences: ~A v B

Fake Quiz! Construct a truth table for the following compound sentence: (A & ~B) > C

Validity Some things to remember about validity: We assume the premises are true to see if the conclusion must also be true When we checked the validity of categorical arguments, recall, we diagrammed each claim as if it was true When we check for the validity of arguments in sentential logic we will also assume that the premises are true

A Quick Example Assume that we know that the sentence: A & B Is true Given what we know about the truth table for a conjunction what else must be true? A B A & B T F

Modus Ponens Modus ponens is a very common argument form, one that we have already seen quite a bit in this course: P > Q P :. Q If we have a conditional AND the antecedent of that conditional as a premise then we can always derive the consequent of the conditional Why does this work?

Modus Ponens P Q P > Q T F Knowing that P > Q is true does not allow us to derive the truth value of the antecedent or consequent because a conditional can be true when the two are true or false If we know that the antecedent is true however we only have one option for the consequent because we must assume the premises are true P Q P > Q T F

Modus Ponens All modus ponens arguments are valid Example: If it is Monday then we are not having a quiz It is Monday :. We are not having a quiz M Q M > ~Q T F

Modus Tollens Modus Tollens is another valid argument form All Modus Tollens arguments are valid P > Q ~Q :. ~P If you see an argument with a conditional as a premise and where the negation of the antecedent is also a premise then you can safely conclude that the antecedent is false

Modus Tollens Test out Modus Tollens using the truth table on the right: 1. Assume that the conditional is true 2. Assume that the consequent is false What must follow using those assumptions? P Q P > Q T F

Chain Argument The Chain argument is an argument made entirely of conditional sentences The consequent of one of the conditionals must be the antecedent of the second conditional P > Q Q > R :. P > R The logic of the truth tables again makes it clearer why this is a valid argument form

Chain Argument P Q R P > Q Q > R P > R T F

Invalid Argument Forms Modus Ponens, Modus Tollens, and the Chain Argument are all valid argument forms There are other argument forms that look like these but are NOT valid Do not use these invalid argument forms Affirming the Consequent 1. P > Q 2. Q 3. :. P Denying the Antecedent 1. P > Q 2. ~P 3. :. ~Q

Testing the Invalid Argument Forms Affirming the Consequent 1. P > Q 2. Q 3. :. P Denying the Antecedent 2. ~P 3. :. ~Q P Q P > Q T F

For Next Time Homework Due! Read Chapter 9 pages 317-328 Ch. 9 Homework #1: (9-1): 1,2,3; (9-2): 1,3,8,12,15,20; (9-3): construct only 3 truth tables