1. 2 Day 1Intro Day 2Chapter 1 Day 3Chapter 2 Day 4Chapter 3 Day 5Chapter 4 Day 6Chapter 4 Day 7Chapter 4 Day 8EXAM #1 40% of Exam 1 60% of Exam 1 warm-up.

Slides:



Advertisements
Similar presentations
Geometry Logic.
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.
Logic & Critical Reasoning
Chapter 3 section 2. Please form your groups The 1 st column represents all possibilities for the statement that can be either True or False. The 2 nd.
Truth Tables Presented by: Tutorial Services The Math Center.
1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: The Moon is made of green cheese. Trenton.
Logic ChAPTER 3 1. Truth Tables and Validity of Arguments
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.
John Rosson Thursday February 15, 2007 Survey of Mathematical Ideas Math 100 Chapter 3, Logic.
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.
1 Intro to Logic Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
Boolean Algebra Computer Science AND (today is Monday) AND (it is raining) (today is Monday) AND (it is not raining) (today is Friday) AND (it is.
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.
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
The semantics of SL   Defining logical notions (validity, logical equivalence, and so forth) in terms of truth-value assignments   A truth-value assignment:
Propositional Logic USEM 40a Spring 2006 James Pustejovsky.
Through the Looking Glass, 1865
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.
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.
Phil 120 week 1 About this course. Introducing the language SL. Basic syntax. Semantic definitions of the connectives in terms of their truth conditions.
Propositional Logic 7/16/ Propositional Logic A proposition is a statement that is either true or false. We give propositions names such as p, q,
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Homework 3.
Truth Tables for Negation, Conjunction, and Disjunction.
3.2 – Truth Tables and Equivalent Statements
TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound 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!
Propositional Logic.
Chapter 1 Section 1.4 More on Conditionals. There are three statements that are related to a conditional statement. They are called the converse, inverse.
Conditional Statements M Deductive Reasoning Proceeds from a hypothesis to a conclusion. If p then q. p  q hypothesis  conclusion.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Valid and Invalid Arguments
Reason and Argument Chapter 6 (2/3). A symbol for the exclusive ‘or’ We will use ұ for the exclusive ‘or’ Strictly speaking, this connective is not necessary.
Math 240: Transition to Advanced Math Deductive reasoning: logic is used to draw conclusions based on statements accepted as true. Thus conclusions are.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Chapter 3 section 3. Conditional pqpqpq TTT TFF FTT FFT The p is called the hypothesis and the q is called the conclusion.
Chapter 3: Semantics PHIL 121: Methods of Reasoning March 13, 2013 Instructor:Karin Howe Binghamton University.
Conditional Statements
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,
Propositional Logic. Propositions Any statement that is either True (T) or False (F) is a proposition Propositional variables: a variable that can assume.
Philosophical Method  Logic: A Calculus For Good Reason  Clarification, Not Obfuscation  Distinctions and Disambiguation  Examples and Counterexamples.
Warmup Answer the following True/False questions in your head: I have brown hair AND I am wearing glasses I am male OR I am wearing sneakers I am NOT male.
How do I show that two compound propositions are logically equivalent?
LOGIC.
Introductory Logic PHI 120 Presentation: "Truth Tables – Validity vs. Soundness" This PowerPoint Presentation contains a large number of slides, a good.
Formal Test for Validity. EVALUATIONS Evaluations An evaluation is an assignment of truth-values to sentence letters. For example: A = T B = T C = F.
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.
Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,
Chapter 7 Evaluating Deductive Arguments II: Truth Functional Logic Invitation to Critical Thinking First Canadian Edition.
Invitation to Critical Thinking Chapter 7 Lecture Notes Chapter 7.
Outline Logic Propositional Logic Well formed formula Truth table
Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.
Mathematics for Computing Lecture 2: Computer Logic and Truth Tables Dr Andrew Purkiss-Trew Cancer Research UK
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.
Symbolic Logic and Rules of Inference. whatislogic.php If Tom is a philosopher, then Tom is poor. Tom is a philosopher.
Reasoning and Proof Chapter Use Inductive Reasoning Conjecture- an unproven statement based on an observation Inductive reasoning- finding a pattern.
Logic and Truth Tables Winter 2012 COMP 1380 Discrete Structures I Computing Science Thompson Rivers University.
Sound Arguments and Derivations. Topics Sound Arguments Derivations Proofs –Inference rules –Deduction.
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 =
If there is any case in which true premises lead to a false conclusion, the argument is invalid. Therefore this argument is INVALID.
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:

1

2 Day 1Intro Day 2Chapter 1 Day 3Chapter 2 Day 4Chapter 3 Day 5Chapter 4 Day 6Chapter 4 Day 7Chapter 4 Day 8EXAM #1 40% of Exam 1 60% of Exam 1 warm-up

3

4 an argument is valid if and only if it is impossible for the conclusion to be false while the premises are true an argument is invalid if and only if it is possible for the conclusion to be false while the premises are true

5 an argument is valid if and only if case there is no case in which the premises are true and the conclusion is false an argument is invalid if and only if case there is at least one case in which the premises are true and the conclusion is false

6 case A case is a possible combination of truth-values assigned to the atomic formulas.

7 case 4 case 3 case 2 case 1 SR cases If an argument form has 2 atomic sentences, then there are 4 cases [4 = 2 2 ]. F T F TT T F F

8 cases If an argument form has 3 atomic sentences, then there are 8 cases [8 = 2 3 ]. QRS case 1 TTT case 2 TTF case 3 TFT case 4 TFF case 5 FTT case 6 FTF case 7 FFT case 8 FFF

9 / not R ; not S if R then S /  R ;  S R  S / conclusion ; premise premise

10 R  S ; S; S F T F T S F 4 F 3 T 2 T 1 / R/ R Rcase Is there a case in which the premises are all true but the conclusion is false? Is the argument form valid or invalid? T T F T T F T F T T F F VALID NO

11 Example 2 Evil Twin of Modus Tollens / not S ; not R if R then S /  S ;  R R  S / conclusion ; premise premise

12 / I don't live in Mass ; I don't live in Boston if I live in Boston then I live in Mass FTT / not S ; not R if R then S

13 F T F T S F 4 F 3 T 2 T 1 R  S ; R; R / S/ S Rcase Is there a case in which the premises are all true but the conclusion is false? Is the argument form valid or invalid? T YES INVALID T F T T T F F T F T F

14 / S ; R if R then S / S ; R R  S / conclusion ; premise premise

15 R  S ; R F T F T S F 4 F 3 T 2 T 1 / S Rcase Is there a case in which the premises are all true but the conclusion is false? Is the argument form valid or invalid? T T F T F F T T F T F T VALID NO

16 / R ; S if R then S / R ; S R  S / conclusion premise Example 4 Evil Twin of Modus Ponens ; premise

17 / I live in Boston ; I live in Mass if I live in Boston then I live in Mass FTT / R ; S if R then S

18 R  S ; S F T F T S F 4 F 3 T 2 T 1 / R Rcase Is there a case in which the premises are all true but the conclusion is false? Is the argument form valid or invalid? T YES INVALID T F T F T F T F F T T

19 / S ; not R R or S / S ;  R R  S / conclusion ; premise premise

20 R  S ; R; R F T F T S F 4 F 3 T 2 T 1 / S Rcase Is there a case in which the premises are all true but the conclusion is false? Is the argument form valid or invalid? F T T T T T F F F T F T VALID NO

21 / not S ; R R or S /  S ; R R  S / conclusion ; premise premise Example 6 Evil Twin of MTP

22 R  S ; R; R F T F T S F 4 F 3 T 2 T 1 / S/ S Rcase Is there a case in which the premises are all true but the conclusion is false? Is the argument form valid or invalid? F YES INVALID T T T F F T T T F T F

23 / / not ( R and S)  ( R & S ) RR not R

24 / F T F T S )  F F T T ( R& F F T T R  Is there a case in which the premises are all true but the conclusion is false? Is the argument form valid or invalid? T T F F T T T F F F F T VALID NO

25 / / not ( R and S)not R  ( R & S ) RR

26 / Is there a case in which the premises are all true but the conclusion is false? Is the argument form valid or invalid?INVALID YES F F T T R  T T F F F T F T S )  F F T T ( R& T T T F F F F T

27 logically equivalent Two formulas are logically equivalent if and only if they have the same truth-value no matter what (in every case).

28 not R and not S = not ( R and S) IT IS JUST LIKE MATH! ZOMBIE REASONING not R or not S = not ( R or S) x 2 + y 2 = ( x + y) 2  x +  y =  ( x + y)    

29 not R and not S  not ( R and S) not R or not S  not ( R or S)

30 F F T T R&  & F T F T S F T F T S ) //  F F T T ( R  Are the two formulas logically equivalent? F F F T T T T F T T F F T F T F T F F F Do the formulas match in truth value?NONO NONO

31 F F T T R  F T F T S F T F T S ) //  F F T T ( R  Are the two formulas logically equivalent? F T T T T F F F T T F F T F T F T T T F Do the formulas match in truth value?NONO NONO

32  ( R&S ) //  R   S F TTTTT F FT T TFFFT T TF T FFTTF T FT T FFFTF T TF Are the two formulas logically equivalent?YES Do the formulas match in truth value?YES

33  ( R  S ) //  R&  S F TTTFT F FT F TTFFT F TF F FTTTF F FT T FFFTF T TF Do the formulas match in truth value? Are the two formulas logically equivalent?YES

34