Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.

Slides:



Advertisements
Similar presentations
Logic ChAPTER 3.
Advertisements

Propositional Equivalences
Propositional Equivalences. L32 Agenda Tautologies Logical Equivalences.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
CS128 – Discrete Mathematics for Computer Science
SEVENTH EDITION and EXPANDED SEVENTH EDITION
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter 3 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Propositions and Truth Tables
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.4 Equivalent Statements.
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.
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.
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.
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
Copyright © 2005 Brooks/Cole, a division of Thomson Learning, Inc. Chapter 10 Logic Section 10.1 Statements Section 10.2 Conditional Statements Section.
Section 3.5 Symbolic Arguments
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.7 Switching Circuits.
Slide Copyright © 2009 Pearson Education, Inc. 3.7 Switching Circuits.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
Lecture Propositional Equivalences. Compound Propositions Compound propositions are made by combining existing propositions using logical operators.
Reading: Chapter 4 (44-59) from the text book
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.3 Logical Equivalence.
Chapter 7 Logic, Sets, and Counting
Thinking Mathematically Equivalent Statements, Conditional Statements, and De Morgan’s Laws.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.
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.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.3 Truth Tables for the Conditional and Biconditional.
Chapter 7 Logic, Sets, and Counting Section 1 Logic.
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.
Chapter 1: The Foundations: Logic and Proofs
Chapter 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.4, Slide 1 3 Logic The Study of What’s True or False or Somewhere in Between 3.
LECTURE 1. Disrete mathematics and its application by rosen 7 th edition THE FOUNDATIONS: LOGIC AND PROOFS 1.1 PROPOSITIONAL LOGIC.
Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
Simple Logic.
Introduction to Logic © 2008 Pearson Addison-Wesley.
Truth Tables for Negation, Conjunction, and Disjunction
2. The Logic of Compound Statements Summary
The Foundations: Logic and Proofs
AND.
Thinking Mathematically
Truth Tables and Equivalent Statements
Truth Tables for Negation, Conjunction, and Disjunction
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 8 Logic Topics
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Propositional Equivalences
Information Technology Department
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Section 3.4 Equivalent Statements
TRUTH TABLES continued.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Equivalent Statements
Equivalent Statements
Statements of Symbolic Logic
Section 3.7 Switching Circuits
Section 3.3 Truth Tables for the Conditional and Biconditional
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
Truth Tables for the Conditional and Biconditional
CHAPTER 3 Logic.
Section 3.4 Equivalent Statements
Presentation transcript:

Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND

Copyright © 2009 Pearson Education, Inc. Chapter 3 Section 3 - Slide 2 Chapter 3 Logic

Copyright © 2009 Pearson Education, Inc. Chapter 3 Section 3 - Slide 3 WHAT YOU WILL LEARN Truth tables for conditional statements, and biconditional statements Self-contradictions, tautologies, and implications Equivalent statements, De Morgan’s law, and variations of conditional statements

Copyright © 2009 Pearson Education, Inc. Chapter 3 Section 3 - Slide 4 Section 3 Truth Tables for the Conditional and Biconditional

Chapter 3 Section 3 - Slide 5 Copyright © 2009 Pearson Education, Inc. Conditional The conditional statement p  q is true in every case except when p is a true statement and q is a false statement. TFFCase 4 TTFCase 3 FFTCase 2 TTTCase 1 qp

Chapter 3 Section 3 - Slide 6 Copyright © 2009 Pearson Education, Inc. Biconditional The biconditional statement, p↔q means that p  q and q  p or, symbolically (p  q)  (q  p) order of steps FTFTFTFFFcase 4 FFTFTTFTFcase 3 TTFFFFTFTcase 2 TTTTTTTTTcase 1 p)(qq)(pqp

Chapter 3 Section 3 - Slide 7 Copyright © 2009 Pearson Education, Inc. Example: Truth Table with a Conditional Construct a truth table for ~p  ~q. Solution: Construct standard four case truth table. pq~p~p  ~q~q TTFFTTFF TFTFTFTF F F T T T T F T F T F T Then fill-in the table in order, as follows: It’s a conditional, the answer lies under the 

Chapter 3 Section 3 - Slide 8 Copyright © 2009 Pearson Education, Inc. Self-Contradiction A self-contradiction is a compound statement that is always false.  When every truth value in the answer column of the truth table is false, then the statement is a self-contradiction.

Chapter 3 Section 3 - Slide 9 Copyright © 2009 Pearson Education, Inc. Tautology A tautology is a compound statement that is always true.  When every truth value in the answer column of the truth table is true, the statement is a tautology.

Chapter 3 Section 3 - Slide 10 Copyright © 2009 Pearson Education, Inc. Implication An implication is a conditional statement that is a tautology.  The consequent will be true whenever the antecedent is true.

Copyright © 2009 Pearson Education, Inc. Chapter 3 Section 3 - Slide 11 Section 4 Equivalent Statements

Chapter 3 Section 3 - Slide 12 Copyright © 2009 Pearson Education, Inc. Equivalent Statements Two statements are equivalent if both statements have exactly the same truth values in the answer columns of the truth tables.  In a truth table, if the answer columns are identical, the statements are equivalent. If the answer columns are not identical, the statements are not equivalent. Sometimes the words logically equivalent are used in place of the word equivalent.

Chapter 3 Section 3 - Slide 13 Copyright © 2009 Pearson Education, Inc. De Morgan’s Laws

Chapter 3 Section 3 - Slide 14 Copyright © 2009 Pearson Education, Inc. Example: Using De Morgan’s Laws to Write an Equivalent Statement Use De Morgan’s laws to write a statement logically equivalent to “Benjamin Franklin was not a U.S. president, but he signed the Declaration of Independence.” Solution: Let p: Benjamin Franklin was a U.S. president The statement symbolically is ~p  q. q: Benjamin Franklin signed the Declaration of Independence

Chapter 3 Section 3 - Slide 15 Copyright © 2009 Pearson Education, Inc. Example: Using De Morgan’s Laws to Write an Equivalent Statement (continued) Therefore, the logically equivalent statement to the given statement is: “It is false that Benjamin Franklin was a U.S. president or Benjamin Franklin did not sign the Declaration of Independence.” The logically equivalent statement in symbolic form is

Chapter 3 Section 3 - Slide 16 Copyright © 2009 Pearson Education, Inc. To change a conditional statement into a disjunction, negate the antecedent, change the conditional symbol to a disjunction symbol, and keep the consequent the same. To change a disjunction statement to a conditional statement, negate the first statement, change the disjunction symbol to a conditional symbol, and keep the second statement the same. Switching Between a Conditional and a Disjunction

Chapter 3 Section 3 - Slide 17 Copyright © 2009 Pearson Education, Inc. Variations of the Conditional Statement The variations of conditional statements are the converse of the conditional, the inverse of the conditional, and the contrapositive of the conditional.

Chapter 3 Section 3 - Slide 18 Copyright © 2009 Pearson Education, Inc. “if not q, then not p”~p~q Contrapositive of the conditional “if not p, then not q” ~q~p Inverse of the conditional “if q, then p” pq Converse of the conditional “if p, then q”qpConditional Read Symbolic Form Name Variations of the Conditional Statement