Truth Tables for Conditional and Biconditional Statements

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

Chapter 21: Truth Tables.
Truth Tables How to Make and Use. Making a Truth Table To determine the number of rows other than the heading row. To determine the number of rows other.
Notes on Logic Continued
CS128 – Discrete Mathematics for Computer Science
Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
Uses for Truth Tables Determine the truth conditions for any compound statementDetermine the truth conditions for any compound statement Determine whether.
Mathematical Induction Assume that we are given an infinite supply of stamps of two different denominations, 3 cents and and 5 cents. Prove using mathematical.
Truth Tables for Negation, Conjunction, and Disjunction.
Propositions and Truth Tables
Chapter 3 Section 4 – Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
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.
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.
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
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.
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.
Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
Section 2-2: Conditional Statements. Conditional A statement that can be written in If-then form symbol: If p —>, then q.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.3 Truth Tables for the Conditional and Biconditional.
Thinking Mathematically
Section 1.2: Propositional Equivalences In the process of reasoning, we often replace a known statement with an equivalent statement that more closely.
© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.4, Truth Tables for the Conditional and the Biconditional.
Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)
Thinking Mathematically Arguments and Truth Tables.
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
Chapter 2 Logic 2.1 Statements 2.2 The Negation of a Statement 2.3 The Disjunction and Conjunction of Statements 2.4 The Implication 2.5 More on Implications.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
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.
Conditional statement or implication IF p then q is denoted p ⇒ q p is the antecedent or hypothesis q is the consequent or conclusion ⇒ means IF…THEN.
2. The Logic of Compound Statements Summary
Propositional Logic.
The Foundations: Logic and Proofs
AND.
Thinking Mathematically
CHAPTER 3 Logic.
Truth Tables for Negation, Conjunction, and Disjunction
COMP 1380 Discrete Structures I Thompson Rivers University
The Conditional And Circuits
Classwork/Homework Classwork – Page 90 (11 – 49 odd)
How do I show that two compound propositions are logically equivalent?
(CSC 102) Discrete Structures Lecture 2.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
3.4 Truth Tables for the Conditional and the Biconditional
Truth Tables for Negation, Conjunction, and Disjunction
6.1 Symbols and Translation
Chapter 8 Logic Topics
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
1.2 Propositional Equivalences
Propositional Equivalences
Information Technology Department
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Lecture 2: Propositional Logic
1.2 Propositional Equivalences
Statements of Symbolic Logic
CHAPTER 3 Logic.
CHAPTER 3 Logic.
COMP 1380 Discrete Structures I Thompson Rivers University
1.2 Propositional Equivalences
Section 3.3 Truth Tables for the Conditional and Biconditional
Truth Tables for the Conditional and Biconditional
Statements and Logical Connectives
1.3 Propositional Equivalences
CHAPTER 3 Logic.
CHAPTER 3 Logic.
Presentation transcript:

Truth Tables for Conditional and Biconditional Statements Section 2.4 Truth Tables for Conditional and Biconditional Statements

Objectives Understand the logic behind the definition of the conditional and the biconditional. Construct truth tables for conditional and biconditional statements. Determine the truth value of a compound statement for a specific case.

Conditional, , if…then Suppose your teacher promises you the following: If you pass the final, then you pass the course. Break the compound statement down into its two component statements. p: You pass the final. q: You pass the course. Two simple statements – 4 possible cases.

Conditional, , if…then p: You pass the final. q: You pass the course. p  q T F NOTE: A conditional is false only when the antecedent is T and the consequent is F.

Example 1: Construct truth table. ~p  q

Example 2: Construct truth table. (p q)  (p q)

Example 3: Construct truth table. r  (p q)

Biconditional, , if and only if Suppose your teacher says the following: You will pass the course, iff you pass the final. Break the compound statement down into its two component statements. p: You will pass the course. q: You pass the final. Two simple statements – 4 possible cases.

Biconditional, , iff p: You will pass the course. q: You pass the course. p q p  q T F NOTE: A biconditional is T only when the component statements have the same value.

Example 4: Construct a truth table. (p  q)  q

Example 5: Construct truth table. (p  ~q)  (q  ~p)

Example 6: Construct a truth table. (p r)  ~(q r)

Key Terms Tautology: a compound statement that is true in all cases these statements are also called “implications”. Self-contradiction: a compound statement that is false in all cases.

Example 7: Determine if the statement is a tautology, self- contradiction, or neither. [(p  q) p]  q

Example 8: Determine if the statement is a tautology, self- contradiction, or neither. [(p  q) ~p]  ~q

Example 9: Determine if the statement is a tautology, self- contradiction, or neither. (p q) →(~p ~q)

Example 10: TB pg. 107/7

Section 2.4 Assignment Classwork: TB pg. 107/2 – 20 Even Must write problem and show ALL work to receive credit for the assignment. NOTE: If your truth table is not complete, then your problem is wrong.