CISC 102 Lecture Notes - Lecture 34: Logical Biconditional, Complex Instruction Set Computing, Truth Table

63 views3 pages
Verified Note

Document Summary

Shorthand for the pair of statements is used. If a b and b a then a = b. If a = b then a b and b a. Gives: a = b if and only if a b and b a. Which can be denoted as: a = b (a b) (b a) Note: common abbreviatiuon for if and only if is iff . Truth table for the biconditional implication above: p. Table can be summarized as: biconditional implication is true when both p and q are true, or both p and q are false. Note: p q is logical equivalent of (p > q) (q > p) as well as ( p q) ( q p). The contrapositive is: q > p ? is logical equivalent as verified by truth table below: p. If 2 | a then 2 | (a)(b) is logical equivalent of: If 2 (a)(b) then 2 a.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions