Chapter 3.

Boolean Algebra and Logic Design

Boolean Algebra
Definition: A two-valued Boolean algebra is defined on a set of 2 elements B = {0,1} with 3 binary operators
OR (+), AND ( • ), and NOT ( ' ).
B B
+ 0 1 0 1 '
0 0 1 0 0 0 0 1
A A A
3.2 Axioms - need no proof. 1 1 1 1 0 1 1 0

1. Closure Property.
The result of each operation is an element of B.

2. Identity Element.
a) 1 for AND because x • 1 = 1 • x = x.
b) 0 for OR because x + 0 = 0 + x = x.

3. Commutative Property. From the symmetry of the tables.

a) x • y = y • x.
b) x + y = y + x.

4. Distributive Property.
a) x • (y + z) = (x • y) + (x • z).
b) x + (y • z) = (x + y) • (x + z).

To show that this is true, we need to show that for any value of binary variables x, y, and z, x • (y + z) will have
the same value as (x • y) + (x • z).

x y z y+ z x( y+ z) xy xz (xy) + (xz)
0 0 0 0 0 0 0 0
0 0 1 1 0 0 0 0
0 1 0 1 0 0 0 0
0 1 1 1 0 0 0 0
1 0 0 0 0 0 0 0
1 0 1 1 1 0 1 1
1 1 0 1 1 1 0 1
1 1 1 1 1 1 1 1

5. Complement Element. For every x ∈ B, there exists a complement element x' ∈ B such that:
a) x + x' = 1 0 + 0' = 0 + 1 = 1 and 1 + 1' = 1 + 0 = 1
b) x • x' = 0 0 • 0' = 0 • 1 = 0 and 1 • 1' = 1 • 0 = 0

6. Cardinality Bound. There are at least 2 elements x, y ∈ B such that x ≠ y. 0 ≠ 1.

Chapter 3. Boolean Algebra and Logic Design

3.3 Basic Theorems - need to be proven.

1. Idempotency. Proof of 1a)

a) x + x = x. x + x = (x + x) • 1 by Axiom 2a
b) x• x = x. = (x + x) (x + x') by Axiom 5a
= x + xx' by Axiom 4b
2. a) x + 1 = 1. =x+0 by Axiom 5b
b) x • 0 = 0. =x by Axiom 2b

3. Absorption. Proof of 3a)

a) yx + x = x yx + x = yx + 1x by Axiom 2a
b) (y + x)x = x = x(y + 1) by Axiom 4a
= x1 by Theorem 2a
4. Involution. =x by Axiom 2a
a) (x')' = x
Proof of 3b)
5. Associative. (y + x)x= xy + xx by Axiom 4a
a) (x + y) + z = x + (y + z) = xy + x by Theorem 1b
b) x (y z) = (x y) z =x by Theorem 3a

Proof of 3b)
x y y+x (y+x) x
0 0 0 0
0 1 1 0
De Morgan's Law.
a) (x + y)' = x' y' 1 0 1 1
b) (x y)' = x' + y' 1 1 1 1

Duality Principle.
This principle states that any algebraic equality derived from these axioms will still be valid whenever the OR and
AND operators, and identity elements 0 and 1, have been interchanged. i.e. changing every OR into AND and vice
versa, and every 0 into 1 and vice versa.
Ex. Theorem 1b) follows from Theorem 1a) by the duality principle.

3.4 Boolean Functions

Boolean functions are formed from binary variables and the Boolean operators AND, OR, and NOT. For a given
value of the variables, the value of the function is either 0 or 1. e.g.

3 AND terms

F1 = x y + x y' z + x' y z

2 litererals 3 litererals

This function equals 1 if:

• x = 1 and y = 1 (doesn't matter what z is)
• x = 1, y = 0, and z = 1
• x = 0, y = 1, and z = 1
otherwise, F1 = 0.
Chapter 3. Boolean Algebra and Logic Design

Boolean functions can also be defined by a truth table:

x y z + x y z' = x y (z + z')
Variable Values Function Values = x y (1)
x y z F1 F1' =xy
0 0 0 0 1
0 0 1 0 1
0 1 0 0 1
0 1 1 1 0
1 0 0 0 1
1 0 1 1 0
1 1 0 1 0
1 1 1 1 0

3.4.1 Complement of a Function

The complement of any function F is F '. Its value can be obtained by interchanging the 0's for 1's and 1's for 0's in
the value of F.

There are two ways to determine the algebraic expression for the complement of a function:

1. Apply the generalized form of De Morgan's Law as many times as necessary.

Ex. F '= (x y + x y' z + x' y z)'

= (x y)' (x y' z)' (x' y z)'
= (x' + y') (x' + y + z') (x + y' + z')

Difficult to see when F ' = 1. Easier to see when F ' = 0. F ' = 0 when each term is 0.

2. Use the duality principle, i.e. interchange the AND and OR operators, and by complementing each literal.

Ex. (x y) ⇒ (x' + y')

(x y' z) ⇒ (x' + y + z')
(x' y z) ⇒ (x + y' + z')
therefore, (x y) + (x y' z) + (x' y z) ⇒ (x' + y') (x' + y + z') (x + y' + z')

The same function can be specified by two or more different algebraic expressions.

3.4.2 Graphic representation

Boolean functions can be expressed graphically by connecting together AND, OR, and NOT operators, as specified
by the algebraic expression that was used to define the function.
Ex. F1 = (x y) + (x y' z) + (x' y z)

x y z
F = xy + xy'z + x'yz

xy
+ xy + xy'z
xy'z + F
xy'
xy'z
F'
x'y