CSCI 2011 Lecture Notes - Lecture 1: Functional Completeness, Idempotence, Boolean Function
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 distributes over. Q ( and vise-versa q) p) (p p q)) De morgan"s laws (basically not" distributes and reverses or" and and") P n 1 2. (cid:1166), (cid:1165) are associative, commutative, and distributive. P ( r ( q ( r. P q ( q ( r p ( r. P ( r ( r ( q r. P ( q ( r p ( r.
