Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Slides:



Advertisements
Similar presentations
TRUTH TABLES Section 1.3.
Advertisements

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
3 Logic The Study of What’s True or False or Somewhere in Between.
CS128 – Discrete Mathematics for Computer Science
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
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.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
3.2 – Truth Tables and Equivalent Statements
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.4 Equivalent Statements.
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.
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.7 Switching Circuits.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.1, Slide Logic The Study of What’s True or False or Somewhere in Between.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.1, Slide Logic The Study of What’s True or False or Somewhere in Between.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.3 Logical Equivalence.
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.
Thinking Mathematically
COMP 170 L2 Part 3 of Course Chapter 3 of Textbook.
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.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
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.
 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.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
Chapter 1 Propositional Logic
Introduction to Logic © 2008 Pearson Addison-Wesley.
Truth Tables for Negation, Conjunction, and Disjunction
Presented by: Tutorial Services The Math Center
AND.
DISCRETE MATHEMATICS CHAPTER I.
Thinking Mathematically
Truth Tables and Equivalent Statements
CHAPTER 3 Logic.
Truth Tables for Negation, Conjunction, and Disjunction
Chapter 3: Introduction to Logic
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 8 Logic Topics
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
2 Chapter Introduction to Logic and Sets
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
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.
TRUTH TABLES continued.
(1.4) An Introduction to Logic
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
1 Chapter An Introduction to Problem Solving
Discrete Mathematics Lecture 2: Propositional Logic
1 Chapter An Introduction to Problem Solving
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Equivalent Statements
Statements of Symbolic Logic
Section 3.7 Switching Circuits
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
Section 3.4 Equivalent Statements
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
CHAPTER 3 Logic.
Presentation transcript:

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Chapter 3: Introduction to Logic 3.1 Statements and Quantifiers 3.2 Truth Tables and Equivalent Statements 3.3 The Conditional and Circuits 3.4 More on the Conditional 3.5 Analyzing Arguments with Euler Diagrams 3.6 Analyzing Arguments with Truth Tables 2012 Pearson Education, Inc.

Truth Tables and Equivalent Statements Section 3-2 Truth Tables and Equivalent Statements 2012 Pearson Education, Inc.

Truth Tables and Equivalent Statements Conjunctions Disjunctions Negations Mathematical Statements Truth Tables Alternative Method for Constructing Truth Tables Equivalent Statements and De Morgan’s Laws 2012 Pearson Education, Inc.

Conjunctions The truth values of component statements are used to find the truth values of compound statements. The truth values of the conjunction p and q, symbolized are given in the truth table on the next slide. The connective and implies “both.” 2012 Pearson Education, Inc.

Conjunction Truth Table p and q p q T T T T F F F T F F 2012 Pearson Education, Inc.

Example: Finding the Truth Value of a Conjunction Let p represent the statement 4 > 1, q represent the statement 12 < 9 find the truth of Solution False, since q is false. 2012 Pearson Education, Inc.

Disjunctions The truth values of the disjunction p or q, symbolized are given in the truth table on the next slide. The connective or implies “either.” 2012 Pearson Education, Inc.

Disjunctions p or q p q T T T T F F T F F F 2012 Pearson Education, Inc.

Example: Finding the Truth Value of a Disjunction Let p represent the statement 4 > 1, q represent the statement 12 < 9 find the truth of Solution True, since p is true. 2012 Pearson Education, Inc.

Negation The truth values of the negation of p, symbolized are given in the truth table below. not p p T F 2012 Pearson Education, Inc.

Example: Mathematical Statements Let p represent the statement 4 > 1, q represent the statement 12 < 9, and r represent 0 < 1. Decide whether each statement is true or false. Solution a) False, since ~ p is false. b) True 2012 Pearson Education, Inc.

Truth Tables Use the following standard format for listing the possible truth values in compound statements involving two component statements. p q Compound Statement T T T F F T F F 2012 Pearson Education, Inc.

Example: Constructing a Truth Table Construct the truth table for Solution p q ~ p ~ q T T F T F T F T F F 2012 Pearson Education, Inc.

Number of Rows in a Truth Table A logical statement having n component statements will have 2n rows in its truth table. 2012 Pearson Education, Inc.

Alternative Method for Constructing Truth Tables After making several truth tables, some people prefer a shortcut method where not every step is written out. 2012 Pearson Education, Inc.

Equivalent Statements Two statements are equivalent if they have the same truth value in every possible situation. 2012 Pearson Education, Inc.

Example: Equivalent Statements Are the following statements equivalent? Solution Yes, see the tables below. p q T T F T F F T F F T 2012 Pearson Education, Inc.

De Morgan’s Laws For any statements p and q, 2012 Pearson Education, Inc.

Example: Applying De Morgan’s Laws Find a negation of each statement by applying De Morgan’s Law. a) I made an A or I made a B. b) She won’t try and he will succeed. Solution a) I didn’t make an A and I didn’t make a B. b) She will try or he won’t succeed. 2012 Pearson Education, Inc.