WhatisBooleanAlgebra.pptVIP

The Laws of Logic:Boolean AlgebraA State High Math Club PresentationSTART==TRUE What is Boolean Algebra? Two values True and False - Logic + Set Theory 1 and 0 - Computers + Probability High and Low – Digital Electronics AND - Basic Notation - AND ^ (A AND B) returns true iff A and B are both true Numerically: A * B Identity - 1 0 AND 1 = 0 1 AND 1 = 1 Annihilator - 0 0 AND 0 = 0 1 AND 0 = 0 AND - Representations OR (Inclusive or) - Basic Notation - OR v || (A OR B) returns true if either (or both) of A and B are true Numerically: A + B - A * B Probability: P(A or B) = P(A)+P(B)-P(A AND B) “And/Or” Construction Identity - 0 Annihilator - 1 OR - Representations NOT - Basic Notation NOT ? ~ ! Unary - only takes one argument Others are called binary Returns the opposite of its argument Analogous to negative sign NOT - Representations XOR (Exclusive or) - Derived Notation XOR ^ + (A XOR B) returns true iff exactly one of A and B is true Can also be considered “not equals” “Either/or” construction A XOR B = (A ^ ~B) v (~A ^ B) Numerically: A+B (mod 2) Also A+B – 2*(A*B) – Same formula in probability A XOR 1 = NOT(A) A XOR 0 = A XOR - Representations Equivalence - Derived Notation ≡ == Returns true iff A=B Material Implication - Derived Notation x–y Linguistically “If X, then Y” X is called the antecedent; y is called the consequent False ONLY when x is true and y is false NOT(X) OR Y More intuitively NOT(X AND NOT(Y)) Why is x-y true when x is false??? This means that “If two is odd, then two is even” is a true statement! Tautologies:The Theorems of Boolean Algebra Called laws Proven with either truth tables or derivations Truth table – true iff last column is all 1s (i.e. true for all input values) Example: Proof of X ^ ~X == 0 De Morgan’s Laws:Distributing a NOT ?(xVy)=(?x)^(?y) ?(x^y)=(?x)V(?y) Proofs? Important Laws AND and OR are: Distributive over each other Associative Commutative ~~X = X X^~X==0 Xv~X==1 De Morgan’s Laws A Derivation (w V x) V (y V