For Monday, read Chapter 4, Sections 1 and 2. Nongraded homework: Problems on pages 98-99. Graded HW #4 is due on Friday, Feb. 11, at the beginning of.

Slides:



Advertisements
Similar presentations
Copyright 2008, Scott Gray1 Propositional Logic 4) If.
Advertisements

2.1.4 USING LOGICAL REASONING
Deductive Validity In this tutorial you will learn how to determine whether deductive arguments are valid or invalid. Go to next slide.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Logic & Critical Reasoning
Logic & Critical Reasoning
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.
Deductive Validity In this tutorial you will learn how to determine whether deductive arguments are valid or invalid. Chapter 3.b.
For Friday, read chapter 6, section 2. As nongraded HW, do the problems on p Graded Homework #7 is due on Friday at the beginning of class.
For Wed, read Chapter 3, section 3. Nongraded Homework: Exercises the end of the section. Even better, do Power of Logic, 7.3, A and B. Graded homework.
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.
March 10: Quantificational Notions Interpretations: Every interpretation interprets every individual constant, predicate, and sentence letter of PL. Our.
Reading: Chapter 4, section 4 Nongraded Homework: Problems at the end of section 4. Graded Homework #4 is due at the beginning of class on Friday. You.
The semantics of SL   Defining logical notions (validity, logical equivalence, and so forth) in terms of truth-value assignments   A truth-value assignment:
No new reading for Monday or Wednesday Exam #2 is next Friday, and we’ll review and work on proofs on Monday and Wed.
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.
Critical Thinking: A User’s Manual
CS1502 Formal Methods in Computer Science Lecture Notes 10 Resolution and Horn Sentences.
LOCATING THE STATED MAIN IDEA
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!
Intro to Discrete Structures
3.6 Analyzing Arguments with Truth Tables
2.5 Verifying Arguments Write arguments symbolically. Determine when arguments are valid or invalid. Recognize form of standard arguments. Recognize common.
Validity All UH students are communists. All communists like broccoli. All UH students like broccoli.
Logic and Philosophy Alan Hausman PART ONE Sentential Logic Sentential Logic.
Responding Critically to Texts
The Inverse Error Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13.
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.
Unit 1D Analyzing Arguments. TWO TYPES OF ARGUMENTS Inductive Deductive Arguments come in two basic types:
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.
Properties and Numbers 1.4. Deductive Reasoning Using facts, properties or rules to reach a valid conclusion Conjecture: statement that could be true.
Algebra Problems… Solutions Algebra Problems… Solutions © 2007 Herbert I. Gross Set 10 By Herbert I. Gross and Richard A. Medeiros next.
Please CLOSE YOUR LAPTOPS, and turn off and put away your cell phones, and get out your note- taking materials.
2.8 Methods of Proof PHIL 012 1/26/2001.
Chapter 3: Semantics PHIL 121: Methods of Reasoning March 13, 2013 Instructor:Karin Howe Binghamton University.
Chapter 2 Section 2-1: Conditional Statements
Study Questions for Quiz 1 1. The Concept of Validity (20 points) a. You will be asked to give the two different definitions of validity given in the lecture.
assumption procedures
Thinking Mathematically Arguments and Truth Tables.
2.3 Methods of Proof.
Higher / Int.2 Philosophy 12. Our Learning  Fallacy Reminder  Summary following Homework NAB  Class NAB.
Research Report Writing Presentation
EXPERIMENTS ARE USED TO TEST A HYPOTHESIS PARTS OF AN EXPERIMENT.
Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.
Chapter Eight Predicate Logic Semantics. 1. Interpretations in Predicate Logic An argument is valid in predicate logic iff there is no valuation on which.
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 =
UOP CRT 205 Week 7 Assignment Argument Evaluation Check this A+ tutorial guideline at
a valid argument with true premises.
{P} ⊦ Q if and only if {P} ╞ Q
Jeffrey Martinez Math 170 Dr. Lipika Deka 10/15/13
Introduction to Logic PHIL 240 Sections
Chapter 8 Logic Topics
Evaluating truth tables
Check It Out! Example 1 Write an indirect proof that a triangle cannot have two right angles. Step 1 Identify the conjecture to be proven. Given: A triangle’s.
3 Logic The Study of What’s True or False or Somewhere in Between.
Validity and Soundness
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.5 Symbolic Arguments.
TRUTH TABLES continued.
Introductory Logic PHI 120
6.4 Truth Tables for Arguments
Arguments in Sentential Logic
For Wednesday, read Chapter 4, section 3 (pp )
SUMMARY Logic and Reasoning.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
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.
Presentation transcript:

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 class.

A B GA → (B & G), ~ B  A  ~ B T T T T  T T    T  T   T      T T T   T  T    T T T   T  Answer: Invalid, proven by line seven

Is there an easier way to test for validity? Try going straight to an interpretation that makes all of the premises true and the conclusion false: A B C(A v ~ B) ↔ C,~ C  A → C T  The only possible way to make the conclusion false and the second premise true automatically makes the first premise false. So, the argument is valid.

Here’s another A B C(C v B) → ~ A, ~ C  A → C T   Invalid --Make A true and C false: False conclusion --C’s being false automatically makes the second premise true. --A’s being true makes the consequent of the first premise false; so we have to assign  to the B to make the antecedent false (and the entire premise true).

Summary of the Procedure Assign truth-values to statement letters so as to make the conclusion false. If it’s possible to assign truth-values to the remaining statement letters in a way that makes all of the premises true, then the argument is invalid. If this cannot be done, the argument is valid.

Complications If there’s more than one way to make the conclusion false, then, before you conclude the argument is valid, be sure to check all of the possibilities (reaching a dead end in each case). Partly for this reason, when your answer is ‘valid’, we want you to explain in English the process by which you arrived at your answer.

A B DA → B, D → B, ~ B  A ↔ D If A is true and D false, the conclusion is false. Then, because A is true, B has to be true (to make the first premise true). That, however, makes the third premise false. BUT, we have to check the other way of making the conclusion false before we answer ‘valid’. If D is true and A false, then B has to be true to preserve the truth of the second premise. But this makes the third premise false. So, the argument is valid.

p. 66