6.4 Truth Tables for Arguments

Slides:



Advertisements
Similar presentations
Copyright 2008, Scott Gray1 Propositional Logic 3) Truth Tables.
Advertisements

TRUTH TABLES Section 1.3.
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
Chapter 21: Truth Tables.
1 Valid and Invalid arguments. 2 Definition of Argument Sequence of statements: Statement 1; Statement 2; Therefore, Statement 3. Statements 1 and 2 are.
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.
For Wednesday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C.
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.
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.
For Friday, read chapter 2, sections 1-2 (pp ). As nongraded homework, do the problems on p. 19. Graded homework #1 is due at the beginning of class.
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.
For Friday, read Chapter 3, section 4. Nongraded Homework: Problems at the end of section 4, set I only; Power of Logic web tutor, 7.4, A, B, and C. Graded.
Part 2 Module 3 Arguments and deductive reasoning Logic is a formal study of the process of reasoning, or using common sense. Deductive reasoning involves.
2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.
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.
Validity All UH students are communists. All communists like broccoli. All UH students like broccoli.
GLE Explore the concept of premises, including false premises. Intro to Logic.
Truth-Table Definition of Validity An argument is truth-table valid if it is impossible for the premises to all be True and the conclusion False. I.e.,
The Inverse Error Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
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.
Question of the Day!  We shared a lot of examples of illogical arguments!  But how do you make a LOGICAL argument? What does your argument need? What.
Philosophical Method  Logic: A Calculus For Good Reason  Clarification, Not Obfuscation  Distinctions and Disambiguation  Examples and Counterexamples.
Thinking Mathematically
Thinking Mathematically Arguments and Truth Tables.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.4, Slide 1 3 Logic The Study of What’s True or False or Somewhere in Between 3.
Analyzing Arguments Section 1.5. Valid arguments An argument consists of two parts: the hypotheses (premises) and the conclusion. An argument is valid.
Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.
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 =
Truth Tables, Continued 6.3 and 6.4 March 14th. 6.3 Truth tables for propositions Remember: a truth table gives the truth value of a compound proposition.
Presented by: Tutorial Services The Math Center
2. The Logic of Compound Statements Summary
a valid argument with true premises.
How do I show that two compound propositions are logically equivalent?
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
5 Categorical Syllogisms
Truth Tables How to build them
6.1 Symbols and Translation
Introduction to Logic PHIL 240 Sections
Chapter 8 Logic Topics
Evaluating truth tables
3 Logic The Study of What’s True or False or Somewhere in Between.
Chapter 1 The Foundations: Logic and Proof, Sets, and Functions
2-1 Conditional Statements
3.5 Symbolic Arguments.
TRUTH TABLE TO DETERMINE
Hurley … Chapter 6.5 Indirect Truth Tables
TRUTH TABLES.
TRUTH TABLES continued.
Discrete Mathematics Lecture # 8.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
The most important idea in logic: Validity of an argument.
Deductive Arguments: More Truth Tables
Validity & Invalidity Valid arguments guarantee true conclusions but only when all of their premises are true Invalid arguments do not guarantee true conclusions.
6.3 Truth Tables for Propositions
CHAPTER 3 Logic.
CHAPTER 3 Logic.
Phil2303 intro to logic.
SUMMARY Logic and Reasoning.
Philosophical Methods
Propositional Logic 1) Introduction Copyright 2008, Scott Gray.
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
3.5 Symbolic Arguments.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
CHAPTER 3 Logic.
Presentation transcript:

6.4 Truth Tables for Arguments Propositional Logic 6.4 Truth Tables for Arguments

Truth Tables for Arguments Symbolize the argument using letters for simple propositions. On one line, write the premises separated by single slashes, then the conclusion separated from the premises by a double slash. Apply TTFF and TFTF to each letter,* then draw a truth table for each premise individually, and the conclusion individually. Look for a line where each premise is true but the conclusion is false. If there is such a line, the argument is invalid. If not, it is valid (it isn’t possible for the conclusion to be false when the premises are true). *Recall this applies only when there are 2 simple statements

Truth Tables for Arguments Step 1: If Greg is right, then you are nuts. Oh, and Greg isn’t right. So, you aren’t nuts. R  N ~R ~N

Truth Tables for Arguments Step 2: If Greg is right, then you are nuts. Oh, and Greg isn’t right. So, you aren’t nuts. R  N / ~R // ~N

Truth Tables for Arguments Step 3: If Greg is right, … R  N / ~R // ~N Step 4: Argument is invalid T T T F T F T It is possible for the premises to be true and the conclusion false T F F F T T F Recall: an argument is valid if true premises guarantee the conclusion F T T T F F T F T F T F T F