CSCI 2011 Study Guide - Comprehensive Final Exam Guide - Without Loss Of Generality, Wireless Access Point, Volkswagen Beetle
Document Summary
Connectives are the word for the operators. Is identical to is exclusive or. A tautology is a statement which is true for every combination of t and f for its arguments (every cell of its truth table) Tautologies are useful to find because then a portion of a complicated logical expression simplifies to t. A contradiction is the opposite of a tautology. Not" , or", and and" are a set of connectives which are functionally complete, meaning they can represent any boolean function (cid:1318) distributes over. Ex. p (cid:1319) ( (cid:1319) (cid:1318) (cid:1319) q ( and vise-versa q) p) (p (cid:1319) (cid:1318) ( (cid:1319) p q)) (cid:1319) q. De morgan"s laws (basically not" distributes and reverses or" and and") 1 (cid:1319) p 2 (cid:1318) p n 1 (cid:1319) 2 (cid:1319) p n 1 (cid:1318) 2. (cid:1166), (cid:1165) are associative, commutative, and distributive. P (cid:1319) ( (cid:1318) r ( (cid:1319) q (cid:1318) ( (cid:1319) r.
