Logic ChAPTER 3 1. Truth Tables and Validity of Arguments 3.6 2.

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.
Constructing a Truth Table
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.
Propositional Logic Lecture 10: Oct 29.
Philosophy 148 Chapter 6. Truth-Functional Logic Chapter 6 introduces a formal means to determine whether arguments are valid, so that there is never.
DEDUCTIVE REASONING: PROPOSITIONAL LOGIC Purposes: To analyze complex claims and deductive argument forms To determine what arguments are valid or not.
TF truth, falsity, and indeterminacy P is truth-functionally true iff it has the value T for any truth-value assignment. P is truth-functionally false.
2/17/2008Sultan Almuhammadi1 ICS Logic & Sets (An Overview) Week 1.
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.
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.
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
Introduction to Software Testing Chapter 8.2
Propositional Logic Lecture 1: Sep 2. Content 1.Mathematical proof (what and why) 2.Logic, basic operators 3.Using simple operators to construct any operator.
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.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Homework 3.
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.
3.6 Analyzing Arguments with Truth Tables
CSE 20 DISCRETE MATH Prof. Shachar Lovett Clicker frequency: CA.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
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.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.2 Truth Tables.
Introduction to Software Testing Chapter 3.6 Disjunctive Normal Form Criteria Paul Ammann & Jeff Offutt
3.3: Truth Tables. Types of Statements Negation: ~p Conjunction: p ˄ q (p and q) Disjunction: p V q (p or q, or both) Conditional: p → q (if p, then q)
Boolean Algebra. Logical Statements A proposition that may or may not be true:  Today is Monday  Today is Sunday  It is raining.
Boolean Logic. Boolean Operators (T/F) xyx AND y FFF FTF TFF TTT xyx OR y FFF FTT TFT TTT xNOT x FT TF.
Chapter 7 Logic, Sets, and Counting
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,
CS1022 Computer Programming & Principles Lecture 1 Logic and Proof.
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?
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
LOGIC.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
Boolean Algebra Monday/Wednesday 7th Week. Logical Statements Today is Friday AND it is sunny. Today is Friday AND it is rainy. Today is Monday OR it.
Introductory Logic PHI 120 Presentation: "Truth Tables – Validity vs. Soundness" This PowerPoint Presentation contains a large number of slides, a good.
Lesson 20 INTERPRETING TRUTH TABLES. Review Conditional Statements (Less. 17) Original If p, then q. Converse If q, then p. Inverse If ~p, then ~q. Contrapositive.
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.
Boolean Logic.
Propositional Logic A symbolic representation of deductive inference. Use upper case letters to represent simple propositions. E.g. Friday class rocks.
Notes - Truth Tables fun, fun, and more fun!!!!. A compound statement is created by combining two or more statements, p and q.
Introduction to Software Testing Chapter 3.6 Disjunctive Normal Form Criteria Paul Ammann & Jeff Offutt
Introduction to Software Testing Chapter 3.6 Disjunctive Normal Form Criteria Paul Ammann & Jeff Offutt
Metalogic. TWO CONCEPTIONS OF LOGICAL CONSEQUENCE.
MATH 110 Sec 12-1 Lecture: Intro to Counting Introduction to Counting: Just how many are there?
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.
Welcome to Interactive Chalkboard Glencoe Geometry Interactive Chalkboard Copyright © by The McGraw-Hill Companies, Inc. Developed by FSCreations, Inc.,
Assign Yourself and Do Now Thursday, January 10, 2013.
Chapter 1 Logic and proofs
TF truth, falsity, and indeterminacy P is truth-functionally true iff it has the value T for any truth-value assignment. P is truth-functionally false.
Test #2 Practice MGF 1106 Summer 2011.
Introduction to Software Testing Chapter 8.2
Presentation transcript:

Logic ChAPTER 3 1

Truth Tables and Validity of Arguments 3.6 2

Problem Solving and Arguments Determining Validity 1.Write each premise on a separate line. 2.Write the conclusion after the premises and separate it by a horizontal line. 3.Make a truth table using a column for each premise and a column for the conclusion. 4.Check only the rows in which all the premises are true. For the argument to be valid, the conclusion must be also valid. 3

Problem Solving and Arguments 4 Symbolize each argument using the suggested abbreviations. In each case, determine the validity of the given argument.

Problem Solving and Arguments 5 If you study logic(s), mathematics is easy(e). Mathematics is not easy.. Therefore, you did not study logic. Determine whether the argument is valid.

Problem Solving and Arguments 6 ses → e~ e~ s TTTFF TFFTF FTTFT FFTTT VALID 1 2 c 1 2 c

Problem Solving and Arguments 7 You will be eligible for a grant(e) if you meet all the criteria(m). You do not meet all the criteria.. ∴ So you are not eligible for a grant. Determine whether the argument is valid.

Problem Solving and Arguments 8 mem → e~ m~ e TTTFF TFFFT FTTTF FFTTT INVALID 1 2c 1 2 c

Problem Solving and Arguments 9 pqp → qpq TT TF FT FF VALID Determine whether the argument is valid. T F T T T T F F T F T F 2 1 c 1 2 c

Problem Solving and Arguments 10 Determine whether each argument is valid.

11 SOLUTION: pqrp → qq → r ~ r~ p ~ r → ~ p TTT TTF TFT TFF FTT FTF FFT FFF T T F F T T T T T F T T T F T T V A L I D F T F T F T F T F F F F T T T T T F T F T T T T c 1 2

SOLUTION: pr~r~r~ p~ p~ r → ~ p~ r → ~ p T T F F T F T F F T F T F F T T T F T T prp → r T T F F T F T F T F T T Equivalent 12

pqrp → qq → rp → r TTT TTF TFT TFF FTT FTF FFT FFF T F T F T T T T Problem Solving and Arguments 13 VALID T T F F T T T T T F T T T F T T 12c 1 2 c

Problem Solving and Arguments Find valid conclusions using all the premises. 14 c

pqrsp → qq → r~ s~ r~ s → ~ rp TTTT TTTF TTFT TTFF TFTT TFTF TFFT TFFF FTTT FTTF FTFT FTFF FFTT FFTF FFFT FFFF T T T T F F F F T T T T T T T T T T F F T T T T T T F F T T T T F T F T F T F T F T F T F T F T F F T T F F T T F F T T F F T T T F T T T F T T T F T T T F T T T T T T T T T T F F F F F F F F s T F T F T F T F T F T F T F T F valid c 4

Valid Argument Forms Modus Ponens Modus Tollens Hypothetical Disjunctive Syllogism 16

Problem Solving and Arguments 17 Select the conclusion that will make each entire argument valid. If I drive to work, then I will not be late. If I am not late, then I do not lose any pay. a. If I am late, then I drive to work. b. If I do not lose any pay, then I drive to work. c. If I drive to work, then I do not lose any pay. d. If I do not drive to work, then I lose some pay.

SOLUTION: c. If I drive to work, then I will not lose any pay. p → r valid If I drive to work, then I will not be late. p → q If I am not late, then I do not lose any pay.. q → r a. If I am late, then I drive to work. ~q ~q → p invalid Hypothetical Syllogism b. If I do not lose any pay, then I drive to work. r → p invalid If I drive to work, then I will not lose any pay. p → r d. If I do not drive to work, then I lose some pay. ~p ~p →~r invalid 18 END