Chapter 7 Evaluating Deductive Arguments II: Truth Functional Logic www.criticalthinking1ce.nelson.com Invitation to Critical Thinking First Canadian Edition.

Slides:



Advertisements
Similar presentations
TRUTH TABLES Section 1.3.
Advertisements

TRUTH TABLES The general truth tables for each of the connectives tell you the value of any possible statement for each of the connectives. Negation.
Truth Functional Logic
Logic & Critical Reasoning
Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
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.
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
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.
Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
Today’s Topics n Review of Grouping and Statement Forms n Truth Functions and Truth Tables n Uses for Truth Tables n Truth Tables and Validity.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
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.
Essential Deduction Techniques of Constructing Formal Expressions Evaluating Attempts to Create Valid Arguments.
Through the Looking Glass, 1865
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Critical Thinking: A User’s Manual
3.2 – Truth Tables and Equivalent Statements
Logic ChAPTER 3.
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!
Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 4.
1.1 Sets and Logic Set – a collection of objects. Set brackets {} are used to enclose the elements of a set. Example: {1, 2, 5, 9} Elements – objects inside.
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
3.6 Analyzing Arguments with Truth Tables
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
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.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Logical Arguments. Strength 1.A useless argument is one in which the truth of the premisses has no effect at all on the truth of the conclusion. 2.A weak.
Chapter 10 Evaluating Premises: Self-Evidence, Consistency, Indirect Proof Invitation to Critical Thinking First Canadian.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Deductive Arguments.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
Chapter Four Proofs. 1. Argument Forms An argument form is a group of sentence forms such that all of its substitution instances are arguments.
LOGIC Lesson 2.1. What is an on-the-spot Quiz  This quiz is defined by me.  While I’m having my lectures, you have to be alert.  Because there are.
1 DISJUNCTIVE AND HYPOTHETICAL SYLLOGISMS DISJUNCTIVE PROPOSITIONS: E.G EITHER WHALES ARE MAMMALS OR THEY ARE VERY LARGE FISH. DISJUNCTS: WHALES ARE MAMMALS.(P)
Chapter 3: Semantics PHIL 121: Methods of Reasoning March 13, 2013 Instructor:Karin Howe Binghamton University.
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.
Chapter 8 – Symbolic Logic Professor D’Ascoli. Symbolic Logic Because the appraisal of arguments is made difficult by the peculiarities of natural language,
Thinking Mathematically
LOGIC.
Chapter 12 Informal Fallacies II: Assumptions and Induction Invitation to Critical Thinking First Canadian Edition Joel.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Propositional Logic A symbolic representation of deductive inference. Use upper case letters to represent simple propositions. E.g. Friday class rocks.
TRUTH TABLES. Introduction The truth value of a statement is the classification as true or false which denoted by T or F. A truth table is a listing of.
6.6 Argument Forms and Fallacies
Syllogisms and Three Types of Hypothetical Syllogisms
Chapter 6 Evaluating Deductive Arguments 1: Categorical Logic Invitation to Critical Thinking First Canadian Edition.
MATHEMATICAL REASONING MATHEMATICAL REASONING. STATEMENT A SENTENCE EITHER TRUE OR FALSE BUT NOT BOTH A SENTENCE EITHER TRUE OR FALSE BUT NOT BOTH.
Invitation to Critical Thinking Chapter 7 Lecture Notes Chapter 7.
TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
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.
 Statement - sentence that can be proven true or false  Truth value – true or false  Statements are often represented using letters such as p and q.
Chapter 1 Logic and proofs
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 =
Logical functors and connectives. Negation: ¬ The function of the negation is to reverse the truth value of a given propositions (sentence). If A is true,
AND.
6.1 Symbols and Translation
Chapter 8 Logic Topics
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.
Logical Forms.
TRUTH TABLES.
Concise Guide to Critical Thinking
The Method of Deduction
Arguments in Sentential Logic
Presentation transcript:

Chapter 7 Evaluating Deductive Arguments II: Truth Functional Logic Invitation to Critical Thinking First Canadian Edition Joel Rudinow Vincent E. Barry Mark Letteri

© 2008 by Nelson, a division of Thomson Canada Limited 7-2 Truth Functional Logic  Known as symbolic logic  Uses logical operators  Uses truth tables  Useful in translating claims into categorical statements  Useful in determining validity

© 2008 by Nelson, a division of Thomson Canada Limited 7-3 Truth Tables Sample truth table Modus Ponens PQ P  Q PQ P  Q TTT TFF FTT FFT all possible combinations of truth value for all components of a truth functional compound statement corresponding truth value of the compound statement

© 2008 by Nelson, a division of Thomson Canada Limited 7-4 Logical Operators Represent the relationships between the “truth values” of the compound sentences we make with them. Truth functional analysis is simply a way of keeping track of this.  Symbols ~ = not (negation) & = and (conjunction)  if, then (conditional) v = either or (disjunction)

© 2008 by Nelson, a division of Thomson Canada Limited 7-5 Logical Operators Negation  Negation simply reverses the truth value of the component statement to which it is applied.  The symbol “~” represents the logical operator negation.  Thus “~P” or “not P” represents the negation of P.  Negation operates on a single component statement, P. Since P is either true or false (not true), our truth table for negation required only two lines.  Negation operates on a single component statement, P. Since P is either true or false (not true), our truth table for negation required only two lines. P = The weather is great. ~P = The weather is not great. P~P TF FT

© 2008 by Nelson, a division of Thomson Canada Limited 7-6 Logical Operators Conjunction  The components of a conjunction are called “conjuncts”.  “P” stands for the first conjunct and the letter “Q” stand for the second, and the symbol “&” represents the logical operator conjunction.  Compound statements are based on conjunction. Since P and Q may be either true or false, our truth table for conjunction will require four lines. PQ P & Q TTTTTTTTTTTT TFFTFFTFFTFF FTFFTFFTFFTF FFFFFFFFFFFF The weather is great and I wish you were here.

© 2008 by Nelson, a division of Thomson Canada Limited 7-7 Logical Operators Disjunctions:  Component statements are called “disjuncts”.  At least one of the disjuncts is true (possibly both).  The letters “P” and “Q” represent the two disjuncts and the symbol “v” represents the operator disjunction.  Thus “P v Q” represents the statement “Either P or Q”. PQ P v Q TTTTTTTTTTTT TFTTFTTFTTFT FTTFTTFTTFTT FFFFFFFFFFFF Either you party or you study.

© 2008 by Nelson, a division of Thomson Canada Limited 7-8 Logical Operators Conditionals:  Compound statements in which the “if” statement is the antecedent and the “then” statement is the consequent  The consequent depends on the truth of the antecedent and follows the antecedent  “P” represents the antecedent and “Q” represents the consequent. The symbol “  ” represents the logical operator implication.  Thus “P  Q” represents the conditional “If P then Q”. “only if” has the effect of reversing the conditional relationship between the antecedent and consequent. “only if” has the effect of reversing the conditional relationship between the antecedent and consequent. PQ P  Q PQ P  Q TTTTTTTTTTTT TFFTFFTFFTFF FTTFTTFTTFTT FFTFFTFFTFFT If you study, then you are likely to do better on the quiz.

© 2008 by Nelson, a division of Thomson Canada Limited 7-9 Argument Forms Deductively Valid modus ponens: based on one hypothetical statement and the affirmation of its antecedent. (1)P  Q (2)P (3) Q If good water exists on Earth, then adequate support for life exists on Earth. Good water exists on Earth. Adequate support for life exists on Earth.

© 2008 by Nelson, a division of Thomson Canada Limited 7-10 Argument Forms Deductively Valid modus tollens: based on one hypothetical statement and the denial of its consequent. (1)P  Q (2b) ~Q (3b) ~P If life exists on Mars, then adequate support for life exists on Mars. No adequate support for life exists on Mars _______________________________ No life exists on Mars.

© 2008 by Nelson, a division of Thomson Canada Limited 7-11 Argument Forms Deductively Valid hypothetical syllogism: based on two hypothetical statements as premises, where the consequent of the first is the antecedent of the second. (1)P  Q (2d) Q  R (3d) P  R If life exists on Mars, then adequate support for life exists on Mars. If adequate support for life exists on Mars, then an astronautical mission to Mars is feasible. If life exists on Mars, then an astronautical mission to Mars is feasible.

© 2008 by Nelson, a division of Thomson Canada Limited 7-12 Argument Forms Deductively Valid disjunctive syllogism: based on a disjunction and the denial of one of its disjuncts (1)P v Q (2)~P (3) Q Either the battery is dead or there is a short in the ignition switch. The battery is not dead. There is a short in the ignition switch.

© 2008 by Nelson, a division of Thomson Canada Limited 7-13 Argument Forms Deductively Invalid fallacy of denying the antecedent: based on a hypothetical statement and the denial of its antecedent (1)P  Q (2c) ~P (3c) ~Q If a figure is square then it has four sides. This figure (a rhombus) is not a square. This figure (a rhombus) does not have four sides.

© 2008 by Nelson, a division of Thomson Canada Limited 7-14 Argument Forms Deductively Invalid fallacy of affirming the consequent: based on a hypothetical statement and the affirmation of its consequent. (1)P  Q (2a) Q (3a) P (3a) P If a figure is square, then it has four sides. This rhombus has four sides. This rhombus is square.

© 2008 by Nelson, a division of Thomson Canada Limited 7-15 Constructive Dilemma  An argument form or strategy combining hypothetical and disjunctive premises that seeks to prove its point by showing that it is implied by each of two alternatives, at least one of which must be true.