Dr.
Kholoud Nairoukh
Department of Computer Science
German-Jordanian University
Lecture 10
• Sections of this chapter:
1 – Boolean Functions
2 – Representing Boolean Functions
3 – Logic Gates
4 – Minimization of Circuits
Dr. Kholoud Nairoukh
• A minor generalization of propositional logic.
– In general, an algebra is any mathematical structure
satisfying certain standard algebraic axioms.
• Such as associative/commutative/transitive laws,
etc.
– General theorems that are proved about an algebra
then apply to any structure satisfying these axioms.
• Boolean algebra just generalizes the rules of
propositional logic to sets other than {T,F}.
– E.g., to the set {0,1} of base-2 digits, or the set
{VL, VH} of low and high voltage levels in a circuit.
• We will see that this algebraic perspective lends itself
to the design of digital logic circuits.
Dr. Kholoud Nairoukh
• Boolean complement, sum, product.
• Boolean expressions and functions.
• Boolean algebra identities.
• Duality.
• Abstract definition of a Boolean algebra.
Dr. Kholoud Nairoukh
Dr. Kholoud Nairoukh
• Let B = {0, 1}, the set of Boolean values.
• For all nZ+, any function f:Bn→B is called
a Boolean function of degree n.
• Possible Boolean Functions of Degree 2
Dr. Kholoud Nairoukh
Dr. Kholoud Nairoukh
Dr. Kholoud Nairoukh
Dr. Kholoud Nairoukh
Dr. Kholoud Nairoukh
• Let x1, …, xn be n different Boolean variables.
– n may be as large as desired.
• A Boolean expression (recursive definition) is a
string of one of the following forms:
– Base cases: 0, 1, x1, …, or xn.
– Recursive cases: E1, (E1E2), or (E1+E2), where
E1 and E2 are Boolean expressions.
• A Boolean expression represents a Boolean
function.
– Furthermore, every Boolean function (of a
given degree) can be represented by a
Boolean expression.
Dr. Kholoud Nairoukh
• Two Boolean expressions e1 and e2 that
represent the exact same function f are
called equivalent. We write e1e2, or just
e1=e2.
• The operators ¯, +, and · can be extended
from operating on expressions to operating on
the functions that they represent, in the
obvious way.
Dr. Kholoud Nairoukh
• The dual of a Boolean expression is obtained
by interchanging Boolean sums and Boolean
products and interchanging 0s and 1 s.
• The dual ed of a Boolean expression e
representing function f is obtained by
exchanging + with ·, and 0 with 1 in e.
– The function represented by ed is denoted
fd.
Dr. Kholoud Nairoukh
• Duality principle: If e1e2 then e1de2d.
– Example: The equivalence x(x+y) = x
implies (and is implied by) x + xy = x.
Dr. Kholoud Nairoukh
• Construct an identity from the absorption law
x(x + y ) =x by taking duals.
Solution:
Taking the duals of both sides of this identity
produces the identity
x + xy = x
Dr. Kholoud Nairoukh
• Any Boolean algebra can be proven to satisfy
all the theorems of “ordinary” Boolean
algebra!
• An example of another Boolean algebra:
– For any set U, let B = 2U, 0=, 1=U, =,
=, and =¯ (set complement).
Then, (B,0,1,,,) is a Boolean algebra!
Dr. Kholoud Nairoukh
• A general Boolean algebra is any set B having
elements 0, 1, two binary operators ,, and a unary
operator that satisfies the following laws:
– Identity laws: x 0 = x, x1=x
– Complement laws: x x = 1, x x = 0
– Associative laws:(xy)z = x(yz), (xy)z =
x(yz)
– Commutative laws: x y = y x, x y = y x
– Distributive laws: x(yz) = (xy)(xz),
x(yz)=(xy)(xz).
Dr. Kholoud Nairoukh
