CSLA 2915 Study Guide - Quiz Guide: Idempotence, Surjective Function, Xu

• School: York University
• Department: Computer Science in Liberal Arts
• Course: CSLA 2915
• Professor: Radu Campeanu

Document Summary

Version 7 (2013. 01. 22) and or not q p. (p q) ( p) ( q) p (p q) p. Logical equivalence ( ) laws: (and accepted [short] name) Negations of t and f : [ntf] t f. ( p) p p p p p t t. (p q) ( p) ( q) p (p q) p (equivalence law) (equivalence law) P q if p then q. Implication: [imp] p q p q contrapositive: q p p q p q (p q) (q p) (p q) Binary representation: x3 x2 x1 x0 hex unsigned. [w x y] z is a tautology. P p r q r. (p q) r p q p. P q p q q r. X u, p (x) p (x) is true for all (every) x in u. X u, p (x) p (x) is true for at least one x in u. X d, p (x) x d, p (x) D = {x u | p (x)}