CHAPTER 3 Logic.

Slides:

Advertisements

Similar presentations

3.4 More on the Conditional

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.

Chapter Two Symbolizing in Sentential Logic This chapter is a preliminary to the project of building a model of validity for sentential arguments. We.

04 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.

Today’s Topics Logical Syntax Logical Syntax o Well-Formed Formulas o Dominant Operator (Main Connective) Putting words into symbols Putting words into.

Notes on Logic Continued

2.2 Conditional Statements. Goals Identify statements which are conditional Identify the antecedent and consequent of a conditional statement Negate conditional.

Today’s Topics n Review of Grouping and Statement Forms n Truth Functions and Truth Tables n Uses for Truth Tables n Truth Tables and Validity.

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.

Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.

Propositions and Truth Tables

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 2 Section 5 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.

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.

Conditional. Conditional Statements Vocabulary Conditional: A compound sentence formed by using the words if….then. Given the simple sentences p and q,

Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements

© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 3 Logic.

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

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

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 3 Section 1 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.

What is a Biconditional Students will be able to: 1.Rewrite compound sentences in conditional form 2.Find the biconditional of a conditional 3.Tell when/why.

 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.

Introduction to Logic © 2008 Pearson Addison-Wesley.

Truth Tables for Negation, Conjunction, and Disjunction

If – Then Statements Lesson 1.5.

2. The Logic of Compound Statements Summary

Thinking Mathematically

Truth Tables and Equivalent Statements

CHAPTER 3 Logic.

Truth Tables for Negation, Conjunction, and Disjunction

How do I show that two compound propositions are logically equivalent?

Biconditional - 2 CS-708.

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

Chapter 8 Logic Topics

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Section 3.1 Statements and Logical Connectives

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.

TRUTH TABLES continued.

Discrete Mathematics and Its Applications Kenneth H

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Discrete Mathematics Lecture 2: Propositional Logic

Truth tables 3.2 and 3.3 Constructing Truth tables

Discrete Mathematics Lecture 2: Propositional Logic

Equivalent Statements

Statements of Symbolic Logic

CHAPTER 3 Logic.

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

Statements and Logical Connectives

1.3 Propositional Equivalences

CHAPTER 3 Logic.

2-2 Logic Vocab Statement: A sentence that is either true or false

CHAPTER 3 Logic.

Truth Tables for Conditional and Biconditional Statements

Presentation transcript:

CHAPTER 3 Logic

Truth Tables for the Conditional and the Biconditional 3.4 Truth Tables for the Conditional and the Biconditional

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

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 T F F F T F F

Example: Constructing a Truth Table Construct a truth table for ~q  ~p p q ~q ~p ~q ~p T T F T T F F T F F

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.

Example: Constructing a Truth Table Construct a truth table for [( p  q) ~ p]  q p q p  q ~p (p  q) ~p [( p  q) ~p]  q T T T F T F F T F F

Biconditional Statements p  q p if and only if q: p  q and q  p True only when the component statements have the same truth value. Truth table for the Biconditional p q p  q T T T T F F F T F F

Definitions of Symbolic Logic

Example: 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 -- 665567010. If your number matches the winning pre-selected number and you return the number before the deadline, you will win $1,000,000.00. 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?

Example continued Solution: Assign letters to the simple statements in the claim.

Example continued Now write the underlined claim in the letter in symbolic form:

Example 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.