Outline

• Boolean Algebra
• Introduction
• Elements
• Operators
• Axioms / Postulates
• Arithmetic
• Identities
• Properties
• DeMorgan’s Theorems
• Converting Boolean expression to Truth Table
• Simplification
• Boolean rules for simplification
• Circuit simplification
• Converting Truth Table into Boolean Expressions
Boolean Algebra - Introduction
• Boolean algebra is a system of mathematical logic.
• It is the basic mathematical tool in the analysis and synthesis of
switching circuits. It is a way to express logic functions algebraically.
• Brief History:
• In 1854, George Boole developed an algebraic system now called Boolean
algebra.
• In 1904, E. V. Huntington formulated its postulates.
• In 1938, Claude E. Shannon introduced a two‐valued Boolean algebra called
switching algebra that represented the properties of bistable electrical
switching circuits.
Boolean Algebra
What is it?
It is an algebraic system consisting of the set of Elements, set of
Operators and number of axioms or postulates
• Elements: 0, 1
• Operators
• two binary operators called OR, AND,
• one unary operator NOT.
Boolean Algebraic Identities
• In mathematics, an identity is a statement true for all possible values
of its variable or variables.

• The algebraic identity of x + 0 = x tells us that anything (x) added to

zero equals the original “anything,” no matter what value that
“anything” (x) may be.

• Boolean algebra (like ordinary algebra) has its own unique identities
based on the bivalent states of Boolean variables.
Additive Identities
• Adding Zero
• The first Boolean identity is that the sum of anything and zero is the same as
the original “anything.”
• This identity is no different from its real-number algebraic equivalent:
A+0=A
• No matter what the value of A, the output will always be the same:
• when A=1, the output will also be 1; when A=0, the output will also be 0.
Adding One
• the sum of “anything” and one is one:
• A +1=1
• No matter what the value of A, the sum of A and 1 will always be 1.
Additive Identities
Adding a Quantity to Itself
• the sum is equal to the original quantity:
• 0 + 0 = 0, and 1 + 1 = 1

• Adding a Quantity to Its Complement

• the sum of a variable and its complement must be 1
• A + A’ = 1
Multiplicative Identities (OR)
• Just as there are four Boolean additive identities (A+0, A+1, A+A, and A+A’),
• There are also four multiplicative identities: Ax0, Ax1, AxA, and AxA’.
• Of these, the first two are no different from their equivalent expressions in
regular algebra : Multiplying by 0 or 1
Multiplicative Identities (AND)
• Multiplying a Quantity by Itself
• the product of a Boolean quantity and itself is the original quantity,
• since 0 x 0 = 0 and 1 x 1 = 1:
• AA = A

• Multiplying a Quantity by Its Complement

• the product of a variable and its complement must be 0
• AA’ = 0
Additive (OR) and Multiplicative (AND)
Identities
Double Complement Identity
• Complementing a variable twice (or any even number of times)
results in the original Boolean value.
• (A’)’ = A
Basic Axioms / Identities
AND Operation . ^ OR Operation + v NOT Operation ‘ ̅

Axiom 1 0.0=0 0+0=0 0’ = 1

Axiom 2 0.1=0 0+1=1 1’ = 0

Axiom 3 1.0=0 1+0=1

Axiom 4 1.1=1 1+1=1

Boolean Algebraic Properties
• A type of mathematical identity, called a “property” or a “law,”
describes how differing variables relate to each other in a system of
numbers.
• The Commutative Property
• The Associative Property
• The Distributive Property
The Commutative Law
• Commutative law states that changing the sequence of the variables
does not have any effect on the output of a logic circuit.
• A. B = B. A
• A+B=B+A
• Any binary operation which satisfies the commutative law is referred
to as a commutative operation
Associative Law
• It states that the order in which the logic operations are performed is
irrelevant as their effect is the same.

• ( A. B ). C = A . ( B . C )
• ( A + B ) + C = A + ( B + C)
Distributive Law
• Distributive law states the following conditions:
• A. ( B + C) = (A. B) + (A. C)
• A + (B. C) = (A + B) . ( A + C)
Boolean Algebra Theorems

• The two important theorems which are extremely used in Boolean

algebra are
• De Morgan’s First law
• De Morgan’s second law.
• These two theorems are used to change the Boolean expression.
• The theorem basically helps to
• These two De Morgan’s laws are used to change the expression from
one form to another form (reduce the given Boolean expression in the
simplified form.)
De Morgan’s First law
• The first law states that
• the complement of the product of the variables is equal to the sum of
their individual complements of a variable.
• (A.B)’ = A’+B’.

A B A’ B’ (A.B)’ A’+B’
0 0 1 1 1 1
0 1 1 0 1 1
1 0 0 1 1 1
1 1 0 0 0 0
De Morgan’s Second law
• The first law states that
• the complement of the sum of variables is equal to the product of their
individual complements of a variable.
• (A+B)’ = A’. B’

A B A’ B’ (A.B)’ A’+B’
0 0 1 1 1 1
0 1 1 0 0 0
1 0 0 1 0 0
1 1 0 0 0 0
Truth Table
• The truth table displays the logical operations on input signals in a
table format.
• Every Boolean expression can be viewed as a truth table.
• The truth table identifies all possible input combinations and the
output for each.
Truth Table
X Y AND X Y OR
0 0 0 0 0 0
0 1 0 0 1 1
1 0 0 1 0 1
1 1 1 1 1 1

X Y AND OR
0 0 0 0
0 1 1 1
1 0 1 1
1 1 1 1
Converting Boolean Expression to Truth Table
• Truth Table: Combination of Rows and Columns
• Columns = Variables
• Number of Columns = Number of variable and operations
• Rows = All Possible Input values (distinct combinations) for the variables and
results of operations and expressions.
• Number of Rows = Two power number of variables (n) i.e. 2n
Question
• Draw a truth table for A(B+D)

expressions

A B D B+D A(B+D)

Input variables Resultant Expression

 Question
• Draw a truth table for A(B+D)
A B D B+D A(B+D)

Input combinations
Question
• Draw a truth table for A(B+D)

A B D B+D A(B+D)
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Question
• Draw a truth table for A(B+D)

A B D B+D A(B+D)
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Question
• Draw a truth table for A(B+D)

A B D B+D A(B+D)
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1
Question
• Draw a truth table for A(B+D)

A B D B+D A(B+D)
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 1 0
1 0 0 0 0
1 0 1 1 1
1 1 0 1 1
1 1 1 1 1
Question - 2
• Draw a truth table for (A+B)+(B+D)

A B D A+B B+D (A+B) + (B+D)