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

Slides:

Advertisements

Similar presentations

TRUTH TABLES Section 1.3.

Advertisements

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.

1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: The Moon is made of green cheese. Trenton.

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

Gates and Circuits. Three Main Gates  AND  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.

1 Inference Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.

1 Math 306 Foundations of Mathematics I Math 306 Foundations of Mathematics I Goals of this class Introduction to important mathematical concepts Development.

Through the Looking Glass, 1865

Propositional Logic 7/16/ Propositional Logic A proposition is a statement that is either true or false. We give propositions names such as p, q,

Truth Tables for Negation, Conjunction, and Disjunction.

3.2 – Truth Tables and Equivalent Statements

TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.

Logic ChAPTER 3.

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

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.

Conditional Statements M Deductive Reasoning Proceeds from a hypothesis to a conclusion. If p then q. p  q hypothesis  conclusion.

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

Normal Forms, Tautology and Satisfiability 2/3/121.

CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.

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

Discrete Mathematics Lecture1 Miss.Amal Alshardy.

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)

Boolean Algebra. Logical Statements A proposition that may or may not be true:  Today is Monday  Today is Sunday  It is raining.

Chapter 7 Logic, Sets, and Counting

Conditional Statements

MAIN TOPIC : Statement, Open Sentences, and Truth Values Negation Compound Statement Equivalency, Tautology, Contradiction, and Contingency Converse, Inverse,

Chapter 8 – Symbolic Logic Professor D’Ascoli. Symbolic Logic Because the appraisal of arguments is made difficult by the peculiarities of natural language,

Lecture 9 Conditional Statements CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.

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.

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

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

Chapter 7 Logic, Sets, and Counting Section 1 Logic.

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.

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.

Conditional Statements – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Conditional Statements Reading: Kolman, Section 2.2.

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.

Simplifying Boolean Expressions. Boolean Operators (T/F) xyx AND y FFF FTF TFF TTT xyx OR y FFF FTT TFT TTT xyx XOR y FFF FTT TFT TTF xNOT x FT TF.

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.

Statement Forms and Material Equivalence Kareem Khalifa Department of Philosophy Middlebury College.

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,

Fundamental Logic Gates And, Or, Not. Logic Gates: The Basics Regulate the flow of electricity within circuits to perform desired functionalities Each.

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.

Conditional Statements Lecture 2 Section 1.2 Fri, Jan 20, 2006.

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.

Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.

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

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.

Welcome to Interactive Chalkboard Glencoe Geometry Interactive Chalkboard Copyright © by The McGraw-Hill Companies, Inc. Developed by FSCreations, Inc.,

Assign Yourself and Do Now Thursday, January 10, 2013.

Reasoning and Proof Chapter Use Inductive Reasoning Conjecture- an unproven statement based on an observation Inductive reasoning- finding a pattern.

Chapter 1. Chapter Summary  Propositional Logic  The Language of Propositions (1.1)  Logical Equivalences (1.3)  Predicate Logic  The Language of.

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

Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.

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,

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

2-2 Logic Part 2 Truth Tables.

Presentation transcript:

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

Creating Truth Tables To create truth tables you start with the columns for the propositions p, q, and when needed, r. Then you build the table to show the compound propositions If the final column of the two tables are equivalent, then we say that the statements are logically equivalent

Create Truth tables for and p q p q T F T F T F F F F F T T F T F T F T T F T T T T Because the last two columns are the same these compound propositions are logically equivalent

Example Two – DeMorgan Properties Create and fill in the truth table for p q p q T F T F

YOU DO: Construct Truth tables for: and Are they logically equivalent? p q p q T F T F

YOU DO: Are the following compound propositions logically equivalent?

Construct a truth table for p q What do you notice about the last column? This is called a TAUTOLOGY – when the last column is all true T F

THREE PROPOSITIONS Construct the truth table for p q r T F T T T F T T

Construct a truth table for: p q r T F