© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.4, Truth Tables for the Conditional and the Biconditional.

Slides:



Advertisements
Similar presentations
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.
Advertisements

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
The Language of Propositional Logic The Syntax and Semantics of PL.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Homework 3.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Truth Tables for Negation, Conjunction, and Disjunction.
3.2 – Truth Tables and Equivalent Statements
Logic ChAPTER 3.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 4.
Conjunctions, Disjunctions, and Negations Symbolic Logic 2/12/2001.
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.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Logic Disjunction A disjunction is a compound statement formed by combining two simple sentences using the word “OR”. A disjunction is true when at.
Conditional. Conditional Statements Vocabulary Conditional: A compound sentence formed by using the words if….then. Given the simple sentences p and q,
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
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)
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
Chapter 7 Logic, Sets, and Counting
Chapter 3: Semantics PHIL 121: Methods of Reasoning March 13, 2013 Instructor:Karin Howe Binghamton University.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.
MLS 570 Critical Thinking Reading Notes for Fogelin: Propositional Logic Fall Term 2006 North Central College.
Review Given p: Today is Thursday q: Tomorrow is Friday
Truth Tables Geometry Unit 11, Lesson 6 Mrs. King.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.3 Truth Tables for the Conditional and Biconditional.
Thinking Mathematically
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
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.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Notes - Truth Tables fun, fun, and more fun!!!!. A compound statement is created by combining two or more statements, p and q.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
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.
Lesson 2-2.B Logic: Truth Tables. 5-Minute Check on Lesson 2-2.A Transparency 2-2 Make a conjecture about the next item in the sequence. 1. 1, 4, 9, 16,
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
3.3 – The Conditional A conditional statement is a compound statement that uses the connective if…then. The conditional is written with an arrow, so “if.
 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.
Aim 1.4: To work with conditionals and biconditionals Do Now: Determine the truth value of the following sentences: 1.9 is a prime number and New York.
Section 3.2: Truth Tables for Negation, Conjunction, and Disjunction
© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.3, Truth Tables for Negation, Conjuction, and Disjunction.
Introduction to Logic © 2008 Pearson Addison-Wesley.
AND.
Thinking Mathematically
Truth Tables and Equivalent Statements
CHAPTER 3 Logic.
Truth Tables for Negation, Conjunction, and Disjunction
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.4 Truth Tables for the Conditional and the Biconditional
Chapter 8 Logic Topics
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Discrete Mathematics Lecture 2: Propositional Logic
Statements of Symbolic Logic
CHAPTER 3 Logic.
Section 3.3 Truth Tables for the Conditional and Biconditional
Truth Tables for the Conditional and Biconditional
Statements and Logical Connectives
CHAPTER 3 Logic.
CHAPTER 3 Logic.
Truth Tables for Conditional and Biconditional Statements
Presentation transcript:

© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.4, Truth Tables for the Conditional and the Biconditional

© 2010 Pearson Prentice Hall. All rights reserved. Learning Targets 1.Understand the logic behind the definition of the conditional. 2.Construct truth tables for conditional statements. 3.Understand the definition of the biconditional. 4.Construct truth tables for biconditional statements. 5.Determine the true value of a compound statement for a specific case. 2

© 2010 Pearson Prentice Hall. All rights reserved. Truth Tables for Conditional Statements p  q antecedent  consequent If p then q. A conditional is false only when the antecedent is true and the consequent is false. Conditional p q p  q T T T FF F TT F T 3

© 2010 Pearson Prentice Hall. All rights reserved. Example 1: Constructing a Truth Table Construct a truth table for ~q  ~p p q~q~q~p~p ~q  ~p T FFT T FTFF F TFTT F TTT 4

© 2010 Pearson Prentice Hall. All rights reserved. More on the Conditional Statement You can reverse and negate the antecedent and consequent, and the statement’s truth value will not change. –If you’re cool, you won’t wear clothing with your school name on it. –If you wear clothing with your school name on it, you’re not cool. 5

© 2010 Pearson Prentice Hall. All rights reserved. Example 2: Constructing a Truth Table Construct a truth table for [( p  q)  ~ p]  q p q p  qp  q ~p~p (p  q)  ~p[( p  q)  ~p]  q T T F F T F 6

© 2010 Pearson Prentice Hall. All rights reserved. Example 2: Constructing a Truth Table Construct a truth table for [( p  q)  ~ p]  q p q p  qp  q ~p~p (p  q)  ~p[( p  q)  ~p]  q T TFFT T FTFFT F TTTTT F FTFT 7

© 2010 Pearson Prentice Hall. All rights reserved. Biconditional Statements p  q p if and only if q: p  q and q  p True only when the component statements have the same value. Truth table for the Biconditional p q p  q T T T FF F TF F T 8

© 2010 Pearson Prentice Hall. All rights reserved. Definitions of Symbolic Logic 9

© 2010 Pearson Prentice Hall. All rights reserved. Example 5: Determining the Truth Value of a Compound Statement You receive a letter that states that you have been assigned a Super Million Dollar Prize Entry Number If your number matches the winning pre-selected number and you return the number before the deadline, you will win $1,000, Suppose that your number does not match the winning pre-selected number, you return the number before the deadline and only win a free issue of a magazine. Under these conditions, can you sue the credit card company for making a false claim? 10

© 2010 Pearson Prentice Hall. All rights reserved. Example 5 continued Solution: Assign letters to the simple statements in the claim. 11

© 2010 Pearson Prentice Hall. All rights reserved. Example 5 continued Now write the underlined claim in the letter in symbolic form: 12

© 2010 Pearson Prentice Hall. All rights reserved. Example 5 continued Substitute the truth values for p, q, and r to determine the truth value for the letter’s claim. (p  q)  r (F  T)  F F  F T Our truth-value analysis indicates that you cannot sue the credit card company for making a false claim. 13

© 2010 Pearson Prentice Hall. All rights reserved. HOMEWORK Pg 146 – 147, #2 – 12(e), 22 – 30 (e), 34 – 48(e), 58, 60.