MATH 1010 3.3 Truth Tables and Equivalent Statements Judy Ahrens, 2005 Pellissippi State Technical Community College slide 1 The conditional: If p, then.

Slides:



Advertisements
Similar presentations
Logic The study of correct reasoning.
Advertisements

Logic ChAPTER 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.
Logic & Critical Reasoning
IB Math Studies – Topic 3. IB Course Guide Description.
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.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
3.2 – Truth Tables and Equivalent Statements
Logic ChAPTER 3.
Elementary Logic PHIL Intersession 2013 MTWHF 10:00 – 12:00 ASA0118C Steven A. Miller Day 4.
Propositions and Truth Tables
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
Work booklet Mr Shum. Summarise this webpage on this slide: ict.com/gcse_computing/ocr/212_computing_hardware/binary_lo gic/miniweb/pg2.htmhttp://
Chapter 3 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
MATH 102 Contemporary Math S. Rook
Chapter 5 – Logic CSNB 143 Discrete Mathematical Structures.
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley. All rights reserved.
Review Complete the chart: pq Conditional p  q Converse _  _ TT TF FT FF.
2.2 Conditional Statements You can describe some mathematical relationships using a variety of if-then statements. A conditional – an if-then statement.
CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.
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.
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.
How do I show that two compound propositions are logically equivalent?
Truth Tables Geometry Unit 11, Lesson 6 Mrs. King.
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.
COMP 170 L2 Part 3 of Course Chapter 3 of Textbook.
Graphing Linear Inequalities on a Grid MATH 017 Intermediate Algebra S. Rook.
Conditional Statements and the Converse Geometry Unit 11, Day 7 Ms. Reed.
CSNB143 – Discrete Structure Topic 4 – Logic. Learning Outcomes Students should be able to define statement. Students should be able to identify connectives.
Notes - Truth Tables fun, fun, and more fun!!!!. A compound statement is created by combining two or more statements, p and q.
Inverse, Contrapositive & indirect proofs Sections 6.2/6.3.
 2012 Pearson Education, Inc. Slide Chapter 3 Introduction to Logic.
 To combine propositions using connectives  To construct the truth table of a given compound proposition  To define de Morgan Law for logic  To define.
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.
CS 270 Lecture 1 In Class Problems. Q1: Logic Puzzle You arrive at the end of a long hallway. There are two knights guarding two doors. One knight always.
 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.
 Conjunctive Normal Form: A logic form must satisfy one of the following conditions 1) It must be a single variable (A) 2) It must be the negation of.
L = # of lines n = # of different simple propositions L = 2 n EXAMPLE: consider the statement, (A ⋅ B) ⊃ C A, B, C are three simple statements 2 3 L =
© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.3, Truth Tables for Negation, Conjuction, and Disjunction.
MAKE SURE YOUR ASSIGNMENTS AND ASSIGNMENTS PAGE IS ON YOUR DESK. Quietly begin working on the warm- up.
Presented by: Tutorial Services The Math Center
Thinking Mathematically
Truth Tables and Equivalent Statements
How do I show that two compound propositions are logically equivalent?
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Equivalent Statements and Variations of Conditional Statements
Chapter 8 Logic Topics
Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.
Chapter 3 Introduction to Logic © 2008 Pearson Addison-Wesley.
Equivalent Statements
Equivalent Statements
Statements of Symbolic Logic
Introductory Logic PHI 120
1.2 Propositional Equivalences
Section 3.3 Truth Tables for the Conditional and Biconditional
Truth Tables for the Conditional and Biconditional
1.3 Propositional Equivalences
CHAPTER 3 Logic.
© T Madas.
2-2 Logic Vocab Statement: A sentence that is either true or false
Truth Tables for Conditional and Biconditional Statements
Presentation transcript:

MATH Truth Tables and Equivalent Statements Judy Ahrens, 2005 Pellissippi State Technical Community College slide 1 The conditional: If p, then q. p is the antecedent and q is the consequent. Ex 1: If Ella reaches that note, then she will shatter glass. If p, then q or p q. a) Ella reaches that note and the glass shatters. If both p and q are true, then p q is true. (Ella didn’t lie.) d) Ella doesn’t reach that note and the glass doesn’t shatter. I If p is false and q is false, then p q is true. (Ella didn’t lie.) TF TF T FT F TT p q b) Ella reaches that note and the glass doesn’t shatter. If p is t true and q is false, then p q is false. (Ella didn’t lie.) c) Ella doesn’t reach that note and the glass shatters. If p is t false and q is true, then p q is true. (Ella didn’t lie.)

F F T T F T p q T T F T Truth Tables and Tautologies slide 2 Ex 2: T T F T T T T T T T F F ~p This statement is a tautology because it is always true. The negation of is. If Ella reaches that note, the glass will shatter. Negation: Ella reaches that note and the glass doesn’t shatter. The statement is equivalent to.

Truth Values slide 3 Ex 3: Assume that p and r are false, and q is true. Find the truth value of. The End