LectureCS–DiscreteMathematics.ppt

Lecture 7 - CS 1813 Discrete Math, University of Oklahoma Lecture 7CS 1813 – Discrete Mathematics Equational Reasoning Back to the Future: High-School Algebra Some Laws of Algebra a + 0 = a {+ identity} (-a) + a = 0 {+ complement} a ? 1 = a {? identity} a ? 0 = 0 {? null} a + b = b + a {+ commutative} a + (b+c) = (a+b) + c {+ associative} a?(b+c) = a?b + a?c {distributive law} Equations go both ways Theorem (-1) ? (-1) = 1 (-1) ? (-1) = ((-1) ? (-1)) + 0 {+ id} = ((-1) ? (-1)) + ((-1) + 1) {+ comp} = (((-1)?(-1)) + (-1)) + 1 {+ assoc} = (((-1)?(-1)) + (-1)?1) + 1 {? id} = ((-1)?((-1) + 1)) + 1 {dist law} = ((-1)?0) + 1 {+ comp} = 0 + 1 {? null} = 1 + 0 {+ comm} = 1 {+ id} Laws of Boolean Algebrapage 1 Laws of Boolean Algebrapage 2 Theorem (a ? False) ? (b ? True) = b equations {rule} substitution [formula in eqn / variable in rule] (p ? False) ? (q ? True) names changed to clarify substitutions = False ? (q ? True) {? null} [p /a] = (q ? True) ? False {? comm} [False /a] [q?True /b] = q ? True {? id} [q ? True /a] = q {? id} [q /a] Using Equational Proof Checker Equations the Proof Checker Knows andNull orNull andID orID andIdempotent orIdempotent andComm orComm andAssoc orAssoc andDistOverOr orDistOverAnd Theorem (a ? b) ? b = b ? absorption equations {rule} substitution [formula in eqn / variable in rule] (p ? q) ? q names changed to clarify substitutions = (p ? q) ? (q ? True) {? id} [q /a] = (q ? p) ? (q ? True) {? comm} [p /a] [q /b] = q ? (p ? True) {? dist over ?} [q /a] [True /b] [p /c] = q ? True {? null} [p /a] = q {? id} [q/a] Theorem (a ? b) ? b = b? absorption equations {rule} substitution [formula in eqn / variable in rule] (p ? q) ? q names changed to clarify substitutions … exercise … = q Consistent, But Not Minimalredundancy among laws of Boolean algebra equations {rule} subs