Section 3.2: Truth Tables for Negation, Conjunction, and Disjunction

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

Geometry Logic.
TRUTH TABLES Section 1.3.
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.
Constructing a Truth Table
Logic & Critical Reasoning
Chapter 3 section 2. Please form your groups The 1 st column represents all possibilities for the statement that can be either True or False. The 2 nd.
Truth Tables Presented by: Tutorial Services The Math Center.
Aim: Logic – Conjunction/Disjunction Course: Math Lit. Do Now: Aim: What is the conjunction and disjunction of the truth? True or False Math is a 4-letter.
Introduction to Symbolic Logic
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.
DEDUCTIVE REASONING: PROPOSITIONAL LOGIC Purposes: To analyze complex claims and deductive argument forms To determine what arguments are valid or not.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
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.
The Foundations: Logic and Proofs
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.
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.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
MATH 102 Contemporary Math S. Rook
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Discrete Mathematics Lecture1 Miss.Amal Alshardy.
HAWKES LEARNING Students Count. Success Matters. Copyright © 2015 by Hawkes Learning/Quant Systems, Inc. All rights reserved. Section 3.2 Truth Tables.
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)
Conditional Statements
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.
Chapter 8 – Symbolic Logic Professor D’Ascoli. Symbolic Logic Because the appraisal of arguments is made difficult by the peculiarities of natural language,
Warmup Answer the following True/False questions in your head: I have brown hair AND I am wearing glasses I am male OR I am wearing sneakers I am NOT male.
How do I show that two compound propositions are logically equivalent?
Review Given p: Today is Thursday q: Tomorrow is Friday
Truth Tables Geometry Unit 11, Lesson 6 Mrs. King.
Thinking Mathematically
Logic. Statements, Connectives, and Quantifiers In symbolic logic, we only care whether statements are true or false – not their content. In logic, a.
6.1 Logic Logic is not only the foundation of mathematics, but also is important in numerous fields including law, medicine, and science. Although the.
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
3.1 Statements and Quantifiers 3.2 Truth Tables.  A statement is a declarative sentence that is either true or false.  Examples: Mr. Healey is my math.
Section 1.1. Section Summary Propositions Connectives Negation Conjunction Disjunction Implication; contrapositive, inverse, converse Biconditional Truth.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
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.
Notes - Truth Tables fun, fun, and more fun!!!!. A compound statement is created by combining two or more statements, p and q.
Joan Ridgway. If a proposition is not indeterminate then it is either true (T) or false (F). True and False are complementary events. For two propositions,
UNIT 01 – LESSON 10 - LOGIC ESSENTIAL QUESTION HOW DO YOU USE LOGICAL REASONING TO PROVE STATEMENTS ARE TRUE? SCHOLARS WILL DETERMINE TRUTH VALUES OF NEGATIONS,
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.
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.
Ms. Andrejko 2-2 Logic. Real World Legally Blonde.
Welcome to Interactive Chalkboard Glencoe Geometry Interactive Chalkboard Copyright © by The McGraw-Hill Companies, Inc. Developed by FSCreations, Inc.,
 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.
Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.
© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.3, Truth Tables for Negation, Conjuction, and Disjunction.
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
Logical functors and connectives. Negation: ¬ The function of the negation is to reverse the truth value of a given propositions (sentence). If A is true,
Truth Tables for Negation, Conjunction, and Disjunction
AND.
Thinking Mathematically
CHAPTER 3 Logic.
Truth Tables for Negation, Conjunction, and Disjunction
Boolean logic Taken from notes by Dr. Neil Moore
Statements of Symbolic Logic
Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction
Truth Tables for the Conditional and Biconditional
CHAPTER 3 Logic.
Presentation transcript:

Section 3.2: Truth Tables for Negation, Conjunction, and Disjunction Math 121

Truth Tables A truth table is used to determine when a compound statement is true or false. They are used to break a complicated compound statement into simple, easier to understand parts.

Truth Table for Negation Case 1 Case 2 P ~P T F F T As you can see “P” is a true statement then its negation “~P” or “not P” is false. If “P” is false, then “~P” is true.

Four Possible Cases When a compound statement involves two simple statements P and Q, there are four possible cases for the combined truth values of P and Q. P Q Case 1 Case 2 Case 3 Case 4 T T T F T F F F

When is a Conjunction True? Suppose I tell the class, “You can retake the last exam and you can turn in this lab late.” Let P be “You can retake the last exam” and Q be “You can turn in this lab late.” Which truth values for P and Q make it so that I kept my promise, P Λ Q to the class?

When is a Conjunction True? cont’d. P: “You can retake the last exam.” Q: “You can turn this lab in late.” There are four possibilities. 1. P true and Q true, then P Λ Q is true. 2. P true and Q false, then P Λ Q is false. 3. P false and Q true, then P Λ Q is false. 4. P false and Q false, then P Λ Q is false.

Truth Table for Conjunction P Q Case 1 Case 2 Case 3 Case 4 P Λ Q T T T F T F T F F F F F

3.2 Question 1 What is the truth value of the statement, “WVU is in Arizona and Morgantown is in West Virginia”? 1. True 2. False

When is Disjunction True? Suppose I tell the class that for this unit you will receive full credit if “You do the homework quiz or you do the lab.” Let P be the statement “You do the homework quiz,” and let Q be the statement “You do the lab.” For which truth values of P and Q would I say that you did what I said, which is PVQ to receive full credit for this unit?

When is Disjunction True? cont’d. P: “You do the homework quiz.” Q: “You do the lab.” There are four possibilities: 1. P true and Q true, then P V Q is true. 2. P true and Q false, then P V Q is true. 3. P false and Q true, then P V Q is true. 4. P false and Q false, then P V Q is false.

Truth Table for Disjunction P Q Case 1 Case 2 Case 3 Case 4 P V Q T T T T T F T F T F F F

3.2 Question 2 What is the truth value of the statement, “WVU is in Arizona or Morgantown is in West Virginia”? 1. True 2. False

Truth Table Summary Λ(and), and, V(or) by remembering the following: You can remember the truth tables for ~(not), Λ(and), and, V(or) by remembering the following: ~(not) - Truth value is always the opposite Λ(and)-Always false, except when both are true V(or) - Always true, except when both are false

Making a Truth Table Example Let’s look at making truth tables for a statement involving only ONE Λ or V of simple statements P and Q and possibly negated simple statements ~P and ~Q. For example, let’s make a truth table for the statement ~PVQ

Truth Table for ~PVQ V Q P Q ~P T T F T T T F F F F F T T T T F F T F Final Answer column Opposite of Column 1 Same as Column 2

Another Example: P Λ ~Q Λ ~Q P Q P T T T F F T F T T T F T F F F F F F Final Answer column Same as Column 1 Opposite of Column 2

3.2 Question 3 What is the answer column in the truth table of the statement ~P Λ ~Q ? 1. T 2. T 3. F F F F F T F F F T

~P Λ ~Q Λ ~Q P Q ~P T T F F F T F F F T F T T F F F F T T T Final Answer column Opposite of Column 1 Opposite of Column 2

More Complicated Truth Tables Now suppose we want to make a truth table for a more complicated statement, (PV~Q) V (~PΛQ) We set the truth table up as before. Our final answer will go under the most dominant connective not in parentheses (the one in the middle)

More Complicated Truth Tables Q (P ~Q) (~P Q) T F T T F T F F T T T T T F F F F F T F T T T T F T T T F F Final Answer Opposite of Column 2 Opposite of Column 1 Same as Column 1 OR AND Same as Column 2

More Complicated Truth Tables Now let’s make a truth table for (P V ~Q) Λ (~P Λ Q) Each of the statements in parentheses ( P V ~Q) and (~P Λ Q) are just like the statements we did previously, so we fill in their truth tables as we just did.

More Complicated Truth Tables Q (P ~Q) (~P Q) T F T T F F F F T T T T F F F F F F F F T T T F F T T T F F Final Answer Opposite of Column 2 Opposite of Column 1 Same as Column 1 OR AND Same as Column 2

Constructing Truth Tables with Three Simple Statements So far all the compound statements we have considered have contained only two simple statements (P and Q), with only four true-false possibilities. P Q Case 1 T Case 2 F Case 3 Case 4

Constructing Truth Tables with Three Simple Statements cont’d. When a compound statement consists of three simple statements (P, Q, and R), there are now eight possible true-false combinations.

Constructing Truth Tables with Three Simple Statements cont’d. Q R Case 1 T Case 2 F Case 3 Case 4 Case 5 Case 6 Case 7 Case 8

A Three Statement Example Let,s construct a truth table for the statement (P V Q) Λ ~R using the same techniques as before.

A Three Statement Example Q R (P Q) ~R T F Final Answer T T T T F F F F T T T T T T F F T T F F T T F F F T F T F T F F F T F T F T F T

Practice Determine the Truth Value for the statement IF: P is true, Q is false, and R is true (~ P V ~ Q) Λ (~R V ~ P)

Practice Translate into symbols. Then construct a truth table and indicate under what conditions the compound statement is TRUE. Tanisha owns a convertible and Joan does not own a Volvo.

Practice Construct a Truth Table for the following compound statement: R V(P Λ ~ Q)