Truth Tables (MAT 142) Truth Tables.

Slides:

Advertisements

Similar presentations

TRUTH TABLES Section 1.3.

Advertisements

Propositional Equivalences. L32 Agenda Tautologies Logical Equivalences.

Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 3.2 Truth Tables for Negation, Conjunction, and Disjunction.

Logic 1 Statements and Logical Operators. Logic Propositional Calculus – Using statements to build arguments – Arguments are based on statements or propositions.

Logic Chapter 2. Proposition "Proposition" can be defined as a declarative statement having a specific truth-value, true or false. Examples: 2 is a odd.

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

MAT 142 Lecture Video Series. Truth Tables Objectives Construct a truth table for a given symbolic expression. Determine if two given statements are.

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 9: Boolean Algebra

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

Chapter 2: The Logic of Compound Statements 2.1 Logical Forms and Equivalence 12.1 Logical Forms and Equivalences Logic is a science of the necessary laws.

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

3.2 – Truth Tables and Equivalent Statements

Logic A statement is a sentence that is either true or false (its truth value). Logically speaking, a statement is either true or false. What are the values.

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

3.6 Analyzing Arguments with Truth Tables

Copyright © Curt Hill Truth Tables A way to show Boolean Operations.

Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.

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

MATH 102 Contemporary Math S. Rook

Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.

Thinking Mathematically Logic 3.6 Negations of Conditional Statements and De Morgan’s Laws.

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)

Statements & Truth Tables True or False This statement is true or false.? A T/F statement is a declarative sentence. It has a value of true or false, but.

Chapter 2: The Logic of Compound Statements 2.2 Conditional Statements

Thinking Mathematically Equivalent Statements, Conditional Statements, and De Morgan’s Laws.

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.

Review Given p: Today is Thursday q: Tomorrow is Friday

Truth Tables Geometry Unit 11, Lesson 6 Mrs. King.

Thinking Mathematically

Propositional Logic ITCS 2175 (Rosen Section 1.1, 1.2)

Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.

Logical Form and Logical Equivalence M Logical Form Example 1 If the syntax is faulty or execution results in division by zero, then the program.

ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.

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.

Symbolic Logic The Following slide were written using materials from the Book: The Following slide were written using materials from the Book: Discrete.

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.

 To combine propositions using connectives  To construct the truth table of a given compound proposition  To define de Morgan Law for logic  To define.

Ms. Andrejko 2-2 Logic. Real World Legally Blonde.

 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 Logic and proofs

© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.3, Truth Tables for Negation, Conjuction, and Disjunction.

Introduction to Logic © 2008 Pearson Addison-Wesley.

DISCRETE MATHEMATICS CHAPTER I.

Thinking Mathematically

Truth Tables and Equivalent Statements

Chapter 1 – Logic and Proof

Classwork/Homework Classwork – Page 90 (11 – 49 odd)

Discrete Mathematics Lecture # 2.

2 Chapter Introduction to Logic and Sets

Information Technology Department

MAT 142 Lecture Video Series

Section 3.4 Equivalent Statements

TRUTH TABLES continued.

Chapter 3 Introduction to Logic 2012 Pearson Education, Inc.

Equivalent Statements

Equivalent Statements

Section 3.7 Switching Circuits

Section 3.4 Equivalent Statements

If v.s. Only If v.s. If and Only If (Iff)

Presentation transcript:

Truth Tables (MAT 142) Truth Tables

Objectives Construct a truth table for a given symbolic expression. Determine if two given statements are equivalent using truth tables. Use De Morgan’s Laws to write a statement equivalent to a given statement.

Vocabulary truth table equivalent expressions De Morgan’s Laws

Negation p ~p T F F T

Conjunction p q T F T F F F

Disjunction p q T F T T T F

Conditional p q T F T F T T

Construct a truth table for: Truth Tables (MAT 142) Construct a truth table for: p ~p T F F T T T

Construct a truth table for: p q T F

Construct a truth table for the following statement: If the lyrics are not controversial, then the performance is not banned. p: The lyrics are controversial. q: The performance is banned

Construct a truth table for the following statement: The country singer is in trouble if he is elected. If he is elected, then the country singer is in trouble. p: The country singer is elected. q: The country singer is in trouble.

Construct a truth table for the following statement: If he does not go to jail, he is innocent or has an alibi. p: He goes to jail. q: He is innocent. r: He has an alibi.

Construct a truth tables for: and

Construct truth tables to determine whether the following statements are equivalent. The streets are wet or it is not raining. If it is raining, then the streets are wet.

DeMorgan’s Laws

General Negations