Unformatted text preview: Law: ༉ Negation Laws: , Key Logical Equivalences (cont) ༉ Commutative Laws: , ༉ Associative Laws: ༉ Distributive Laws: (p ∨ (q ∧ r )) ≡ (p ∨ q) ∧ (p ∨ r ) ༉ Absorption Laws: More Logical Equivalences Construc$ng New Logical Equivalences ༉ We can show that two expressions are logically equivalent by developing a series of logically equivalent statements. ༉ To prove that , we produce a series of equivalences beginning with A and ending with B. ༉ Keep in mind that whenever a proposition (represented by...
View
Full
Document
This document was uploaded on 02/27/2014 for the course CS 215 at SIU Carbondale.
 Spring '14
 M.Nojoumian
 Computer Science

Click to edit the document details