BOOLEAN

ALGEBRA
E-J2A1 – GROUP 3
 OBJECTIVES :
 To know who invented the Boolean Algebra
 To explain the use of Boolean Algebra
 To interpret High or Low Voltage as representing True of False
 To know the Basic Boolean Operation
1. AND
2. OR
3. NOT
 To know the important rules use in Boolean Algebra
 To know the Different types of Boolean Laws
 To Simplify Boolean Algebra
 To know and explain De Morgan Theorem
BRIEF HISTORY
 Boolean algebra was invented by George
Boole in 1854. Boolean algebra is often referred to
as the algebra of logic. The English mathematician
George Boole (1815–1864), who is largely
responsible for its beginnings, was the first to apply
algebraic techniques to logical methodology. He
showed that logical propositions and their
connectives could be expressed in the language of
set theory. Thus, Boolean algebra is also the algebra
of sets. Algebra is that branch of mathematics which
is concerned with the relations of quantities.
WHAT IS BOOLEAN
ALGEBRA?
 Boolean algebra, a logic algebra, allows the rules used in
the algebra of numbers to be applied to logic. It
formalizes the rules of logic. Boolean algebra is used to
simplify Boolean expressions which represent
combinational logic circuits. It reduces the original
expression to an equivalent expression that has fewer
terms which means that less logic gates are needed to
implement the combinational logic circuit.
• As well as the logic symbols “0” and “1” being used to
represent a digital input or output, we can also use them
as constants for a permanently “Open” or “Closed” circuit
or contact respectively.

• A set of rules or Laws of Boolean Algebra expressions

have been invented to help reduce the number of logic
gates needed to perform a particular logic operation
resulting in a list of functions or theorems known
commonly as the Laws of Boolean Algebra.
• Boolean Algebra is the mathematics we use to analyze digital gates and
circuits. We can use these “Laws of Boolean” to both reduce and simplify a
complex Boolean expression in an attempt to reduce the number of logic gates
required. Boolean Algebra is therefore a system of mathematics based on
logic that has its own set of rules or laws which are used to define and reduce
Boolean expressions.

• The variables used in Boolean Algebra only have one of two possible values,
a logic “0” and a logic “1” but an expression can have an infinite number of
variables all labelled individually to represent inputs to the expression, For
example, variables A, B, C etc., giving us a logical expression of A + B = C, but
each variable can ONLY be a 0 or a 1.
 To interpret high or low voltage as representing
TRUE or FALSE & To know the variables whose can be
either 1 or 0
 In Boolean Algebra a high voltage represent TRUE (or 1),
and a low voltage represent FALSE (or 0).

TRUE 1
HIGH

LOW FALSE 0
 THREE FUNDAMENTAL OPERATION IN
BOOLEAN ALEGBRA

“NOT” “AND” “OR”

  TAKES A SINGLE BOOLEAN
NO VALUE EITHER TRUE OR
T FALSE AND NEGATES IT.
 BOOLEAN LOGIC TABLE & LOGIC
OPERATION FOR NOT

INPUT OUTPUT o Consider the variable A

o Logical NOT operation: A = A’

TRUE FALSE
o Case 1: A = 0 >> A’ = 1

FALSE TRUE o Case 2: A = 1 >> A’ = 0

  THE “AND” BOOLEAN
AND OPERATION TAKES TWO INPUTS,
BUT STILL HAS A SINGLE
OUTPUT
 BOOLEAN LOGIC TABLE & LOGIC
OPERATION FOR AND
INPUT A INPUT B OUTPUT • Consider 2 Variables A and B

FALSE FALSE FALSE • Logical AND operation : A . B

• Case 1: A . B = 0 . 0 = 0
FALSE TRUE FALSE
• Case 2: A . B = 0 . 1 = 0
TRUE FALSE FALSE
• Case 3: A . B = 1 . 0 = 0

TRUE TRUE TRUE • Case 4: A . B = 1 . 1 = 1

 The OR gate gets its name from
the fact that it behaves after the
OR fashion of the logical inclusive
"or."
 BOOLEAN LOGIC TABLE & LOGICAL
OPERATION FOR OR
INPUT A INPUT B OUTPUT • Logical OR operation: A + B
FALSE FALSE FALSE • Case 1: A + B = 0 + 0 = 0
FALSE TRUE TRUE
• Case 2: A + B = 0 + 1 = 1
TRUE FALSE TRUE
• Case 3: A + B = 1 + 0 = 1
TRUE TRUE TRUE
• Case 4: A + B = 1 + 1 = 1
RULES OF BOOLEAN
ALGEBRA
 This are the following important rules used in Boolean
algebra:

 Variable used can have only two values. Binary 1 for HIGH and Binary 0 for LOW.

 Complement of a variable is represented by an overbar (-). Thus, complement of

variable B is represented as . Thus if B = 0 then = 1 and B = 1 then = 0.

 OR-ing of the variables is represented by a plus (+) sign between them. For
example OR-ing of A, B, C is represented as A + B + C.

 Logical AND-ing of the two or more variable is represented by writing a dot

between them such as A.B.C. Sometime the dot may be omitted like ABC.
INPUT OUTPUT
OVERBAR

(Negated or
Inverse)
 THE DIFFERENT TYPES OF LAWS OF
BOOLEAN ALGEBRA
1. Identity Law
2. Idempotent Law
3. Dominance Law
4. Involution Law / Double Negation Law
5. Negation / Complement Law
LAWS OF BOOLEAN
ALGEBRA
Identity Law Commutative Law
A+0 =A A.B=B.A
A.1 =A A+ B= B+A

Idempotent Law Associative Law

A+A=A A + (B + C) = (A + B) + C
A.A=A A . (B . C) = (A . B) . C

Dominance Law Distributive Law

A+1=1 A + (A . C) = (A + B) . (A + B)
A.0=0 A . (A + C) = (A . B) + (A . B)

Involution / Double Negation Law Absorption Law

A’’ = A A . (A + B) = A
A + (A . B) = A

Negation / Complement Law

A + A’ = 1
A . A’ = 0
 INDENTITY LAW
• Consider the variable A Truth Table
A A+0
• Expression 1 : A + 0 = A
0 0
* A=0 l 0+0 = 0
1 1
* A=1 l 1+0 = 0
• Expression 2 : A . 1 = A
Truth Table
* A=0 l 0.1 = 0
A A.0
* A=1 l 1.1 = 1
0 0

1 1
 INDEMPOTENT LAW
• Consider the variable A Truth Table
A A+A
• Expression 1 : A + A = A
0 0
* A=0 l 0+0 = 0
1 1
* A=1 l 1+1 = 0
• Expression 2 : A . A = A
Truth Table
* A=0 l 0.1 = 0
A A.A
* A=1 l 1.1 = 1
0 0

1 1
 DOMINANCE LAW
• Consider the variable A Truth Table
A A+1
• Expression 1 : A + 1 = 1
0 1
* A=0 l 0+1 = 1
1 1
* A=1 l 1+1 = 1
• Expression 2 : A . A = A
Truth Table
* A=0 l 0.0 = 0
A A.0
* A=1 l 1.0 = 0
0 0

1 0
 INVOLUTION / DOUBLE
NEGATION LAW
 Consider the variable A Truth Table
 Expression 1 : A” = A A A”
*A=0 l 0” = 1’ = 0
*A=1 l 1” = 0’ = 1 0 0

1 1
 NEGATION /
COMPLEMENT LAW
 Consider the variable A Truth Table
 Expression 1 : A + A’ = 1 A A + A’

*A=0 l 0+1 = 1 0 1

*A=1 l 1+0 = 1 1 1

 Expression 2: A . A’ = 0
Truth Table
*A=0 l 0.1 = 0
A A . A’
*A=1 l 1.0 = 0
0 0

1 0
Laws of Boolean Algebra Example No.1
Using the above laws, simplify the following expression: (A + B)(A + C)

Then the expression: (A + B)(A + C) can be simplified to A + (B.C) as in the Distributive law.
WHAT IS DeMORGAN’S THEOREM?

 DeMorgan’s Theorem is mainly used to solve the various

Boolean algebra expressions.The Demorgan’s theorem
defines the uniformity between the gate with same
inverted input and output. It is used for implementing the
basic gate operation likes NAND gate and NOR gate.
 DeMorgan’s theorems state the same equivalence in “backward” form:
that inverting the output of any gate results in the same function as the
opposite type of gate (AND vs. OR) with inverted inputs:
 A long bar extending over the term AB acts as a grouping
symbol, and as such is entirely different from the product of A
and B independently inverted.
 DeMorgan’s theorem may be thought of in terms of breaking
a long bar symbol. When a long bar is broken, the operation
directly underneath the break changes from addition to
multiplication, or vice versa, and the broken bar pieces remain
over the individual variables.
 For example let’s take the expression (A + (BC)’)’ and reduce it
using DeMorgan’s Theorems.
 Breaking the longest (uppermost) bar first, I’ll begin by breaking
the bar covering the entire expression as a first step
 As a result, the original circuit is reduced to a three-input AND
gate with the A input inverted
 You should never break more than one bar in a single step it may
be to conserve steps and break more than one bar at a time, it
often leads to an incorrect result,