l3网络安全.pptVIP

L3 Lecture 3: Propositional Equivalences Zeph Grunschlag Announcements OH’s today moved to 3:30-5pm HW1 due next Monday CVN (Columbia Video Network) is hiring work-study camera operators, multi-media and video streaming people. No experience required. Contact technical@cvn.columbia.edu. Agenda Tautologies Logical Equivalences Tautologies, contradictions, contingencies DEF: A compound proposition is called a tautology if no matter what truth values its atomic propositions have, its own truth value is T. EG: p ? ?p (Law of excluded middle) The opposite to a tautology, is a compound proposition that’s always false –a contradiction. EG: p ? ?p On the other hand, a compound proposition whose truth value isn’t constant is called a contingency. EG: p ? ?p Tautologies and contradictions The easiest way to see if a compound proposition is a tautology/contradiction is to use a truth table. Tautology example (1.2.8.a)Part 1 Demonstrate that [?p ?(p ?q )]?q is a tautology in two ways: Using a truth table – show that [?p ?(p ?q )]?q is always true Using a proof (will get to this later). Tautology by truth table Tautology by truth table Tautology by truth table Tautology by truth table Tautology by truth table Tautologies, contradictions and programming Tautologies and contradictions in your code usually correspond to poor programming design. EG: while(x = 3 || x 3) x++; if(x y) if(x == y) return “never got here”; Logical Equivalences DEF: Two compound propositions p, q are logically equivalent if their biconditional joining p ? q is a tautology. Logical equivalence is denoted by p ? q. EG: The contrapositive of a logical implication is the reversal of the implication, while negating both components. I.e. the contrapositive of p ?q is ?q ??p . As we’ll see next: p ?q ? ?q ??p Logical Equivalence of Conditional and Contrapositive The easiest way to check for logical equivalence is to see if the truth tables of both variants have identical last col