More on Logical Equivalence

Slides:



Advertisements
Similar presentations
Propositional Equivalences
Advertisements

Propositional Equivalences
CSE 311: Foundations of Computing Fall 2013 Lecture 3: Logic and Boolean algebra.
Logic 2 The conditional and biconditional
1 Section 1.7 Set Operations. 2 Union The union of 2 sets A and B is the set containing elements found either in A, or in B, or in both The denotation.
Propositional Logic. Negation Given a proposition p, negation of p is the ‘not’ of p.
1 CA 208 Logic PQ PQPQPQPQPQPQPQPQ
1 CA 208 Logic Ex4 Commutativity (P  Q)  Associativity P  (Q  R)  (P  Q)  R Distributivity P  (Q  R)  Idempotency.
1 Section 1.2 Propositional Equivalences. 2 Equivalent Propositions Have the same truth table Can be used interchangeably For example, exclusive or and.
1 Section 10.1 Boolean Functions. 2 Computers & Boolean Algebra Circuits in computers have inputs whose values are either 0 or 1 Mathematician George.
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
Propositional Equivalence Goal: Show how propositional equivalences are established & introduce the most important such equivalences.
CS1502 Formal Methods in Computer Science
Reading: Chapter 4 (44-59) from the text book
1 Introduction to Abstract Mathematics Expressions (Propositional formulas or forms) Instructor: Hayk Melikya
Boolean Algebras Lecture 27 Section 5.3 Wed, Mar 7, 2007.
Chapter 1: The Foundations: Logic and Proofs
Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer.
Properties of Sets Lecture 26 Section 5.2 Tue, Mar 6, 2007.
Propositional Equivalence A needed step towards proofs Copyright © 2014 Curt Hill.
Functions, equations and algebra Basic Arithmetic Notation and operations.
Symbolic Logic The Following slide were written using materials from the Book: The Following slide were written using materials from the Book: Discrete.
Boolean Algebras Lecture 24 Section 5.3 Wed, Mar 22, 2006.
Law of logic Lecture 4.
Module Code MA0003NI: Computing mathematics Lecture for Week Autumn.
CS-7081 Application - 1. CS-7082 Example - 2 CS-7083 Simplifying a Statement – 3.
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
2. The Logic of Compound Statements Summary
Propositional Logic.
Module 2: Conditionals and Logical Equivalences
The Foundations: Logic and Proofs
Lecture 11: Hardware for Arithmetic
Advanced Algorithms Analysis and Design
Propositional Equivalence
More on Logical Equivalence
August 31, 2005.
Citra Noviyasari, S.Si, MT
Logical Equivalence of Propositions
CHAPTER 2 Boolean Algebra
How do I show that two compound propositions are logically equivalent?
COT 3100, Spr Applications of Discrete Structures
(CSC 102) Discrete Structures Lecture 2.
Discussion #10 Logical Equivalences
Boolean Algebra.
Mathematics for Computing
Discrete Structures for Computer Science
Chapter 8 Logic Topics
Sets and Logic…. Chapter 2
Administrivia Course Web:
Propositional Equivalences
Information Technology Department
Propositional Equivalence (§1.2)
Sets and Logic…. Chapter 3
CS 220: Discrete Structures and their Applications
CSE 311 Foundations of Computing I
CSE 311 Foundations of Computing I
Boolean Algebra.
CSE 311 Foundations of Computing I
Mo’ Truth Tables Part II.
CSS 342 Data Structures, Algorithms, and Discrete Mathematics I
Lecture 2: Propositional Equivalences
The animated version (teaching method 2) Chalk v.s. The Computer
Reasoning with the Propositional Calculus
Boolean Algebra How gates get picked.
Reasoning with the Propositional Calculus
Reasoning with the Propositional Calculus
Reasoning with the Propositional Calculus
A THREE-BALL GAME.
Concepts of Computation
Presentation transcript:

More on Logical Equivalence (I swear this class will not be only slides)

(A.K.A) The Algebra of Logic

What does equivalent mean? Logical Equivalence We have already seen how to check logical equivalence, so today we will be introduced to notation and some important laws, so we may start manipulating symbols (i.e. The Algebra of Logic). What does equivalent mean?

Logical Equivalence When two compound propositions (uses connectives like “and”) are logically equivalent we will use the symbol: For Example One We Have Seen Before:

DeMorgan’s Laws (How negatives distribute) (My Favorite!)

DeMorgan’s Laws (How negatives distribute)

So how would we check these? For Example: The only free propositions

Break it Down like a James Brown Song:

Break it Down like Justin Timberlake:

Break it Down like a Dubstep Song:

Break it down like a cardboard box:

Logically Equivalent!!!

Double Negation Law: (Negative times a Negative!)

Commutative Laws: (Order Doesn’t Matter!)

Associativity Laws: (Order Really Doesn’t Matter!)

Absorption Laws:

Distribution Laws:

Rob’s Law:

Basic Rob’s Law

The Algebra of Logic: Use the basic laws to show that:

The Algebra of Logic: (Rob’s Law) (Distribution Law) (Rob’s Law)

The Algebra of Logic: Use the basic laws to show that:

The Algebra of Logic: (Rob’s Law) (DeMorgan’s Law) (Commutativity Law) (Distribution and Commutativity Law) (Rob’s Law)

The Algebra of Logic: (Contrapositive) Use the basic laws to show that: (Contrapositive)

The Algebra of Logic: (Rob’s Law) (Commutativity Law) (Double Negation Law) (Rob’s Law)

The Algebra of Logic: (Group Work) Use the basic laws to show that: (SL) (GR) (HP) (RC)