LATTICEANDBOOLEANALGEBRA.PDFVIP

2 LATTICE AND BOOLEAN ALGEBRA This chapter presents, lattice and Boolean algebra, which are basis of switching theory. Also presented are some algebraic systems such as groups, rings, and fields. 2.1 ALGEBRA This book considers various algebraic systems. In this section, we present a general form of them. An algebraic system is defined by the tuple (A, 01, ••• , Ok; R 1 , ••• , Rm; C1, ••• , Ck), where, A is a non-empty set, 0i is a function APi -+ A, Pi is a positive integer, Rj is a relation on A, and Ci is an element of A. Example 2.1 (Z, +) is an algebraic system consisting of a set of integers Z and addition (+). (Z, +,~) is an algebraic system consisting of a set of integers Z, addition, and the relation equal to or less than. • 2.2 LATTICE The lattice is an algebraic system (A, V, .) with two binary operations V and and arbitrary elements a, b, C in A satisfy the following four axioms (1)-(4): (1) Idempotent laws: a Va =a, a· a =a; (2) Commutative laws: a V b =b V a, a· b =b . a; (3) Associative laws: a V (b V c) = (a V b) V c, a· (b. c) = (a. b) . C; T. Sasao, Switching Theory for Logic Synthesis © Kluwer Academic Publishers 1999 18 CHAPTER 2 (4) Absorption laws: a V (a. b) ::::; a, a· (a V b) ::::; a. Example 2.2 1. Let A ::::; {O, I}. Let a V b = max{a,b} and a· b = min{a,b} be binary operations on A. Then, the algebraic system (A, V, -) satisfies the axioms of the lattice. 2. Let Z be the set the integers. Let a Vb::::; max{ a, b} and a . b = min {a, b} be binary operations on Z. Th