Lecture03-CaltechParallelandDistributedComputing.PDFVIP

CNS 188a Overview • Boolean algebra as an axiomatic system • Boolean functions and their representations using Boolean formulas and spectral methods • Implementing Boolean functions with relay circuits, circuits of AON (AND, OR, NOT) gates and LT (Linear Threshold) gates • Analyzing the complexity (size and depth) of circuits • Relations (as opposed to functions) and their implementation in circuits • Feedback and convergence in LT circuits Basic Axioms and Properties Last Time Representation Theorem (Stone 1936): Every finite Boolean algebra is isomorphic to a Boolean algebra of subsets of some finite set S. 0-1 Theorem: An identity is true for any finite Boolean algebra if and only if it is true for a two-valued (0-1) Boolean algebra. Stone’s Amazing Theorem Representation Theorem (Stone 1936): Every finite Boolean algebra is isomorphic to a Boolean algebra of subsets of some finite set S. Two Boolean Algebras with m elements are isomorphic k Every Boolean algebra has 2 elements Intuition beyond the axioms: We can ‘naturally’ reason about results in Boolean algebra The 0-1 Theorem 0-1 Theorem: An identity is true for any finite Boolean algebra if and only if it is true for a two-valued (0-1) Boolean algebra. Proof: The easy direction Assume an identity true for any finite Boolean algebra True for 0-1 Boolean algebra The 0-1 Theorem 0-1 Theorem: An identity is true for any finite Boolean algebra if and only if it is true for a two valued (0-1) Boolean algebra. Proof: The non-obvious direction Assume an identity true for a 0-1 Boolean algebra Need to prove true for any finite Boolean algebra The key: Stone’s representation theorem The 0-1 Theorem Proof (cont.): Assume an identity true for 0-1 Boolean algebra