Scribd
Upload
31 views16 pages

Boolean Algebra

Boolean Algebra Theorems

Uploaded by

vijayalakshmis
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
31 views16 pages

Boolean Algebra

Boolean Algebra Theorems

Uploaded by

vijayalakshmis
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 16

BOOLEAN ALGEBRA

Presented By
S.Vijayalakshmi B.E,
Assistant Professor,
Department of Computer Science,
Sri Sarada Niketan College for Women, Karur.
Boolean Algebra
Boolean Algebra is used to analyze
and simplify the digital (logic)
circuits.
 It uses only the binary numbers
i.e. 0 and 1. It is also called
as Binary Algebra or logical
Algebra.
Boolean algebra was invented
by George Boole in 1854.
Boolean Algebra Laws and Theorems
Boolean Algebra is a form of mathematical
algebra that is used in digital logic in digital
electronics. Albebra consists of symbolic
representation of a statement (generally
mathematical statements).
Basic Laws and Proofs
The basic rules and laws of Boolean algebraic
system are known as “Laws of Boolean algebra”.
Some of the basic laws (rules) of the Boolean
algebra are
i. Associative law
ii. Distributive law
iii. Commutative law
iv. Absorption Law
Associate Law Of Addition
Associative law of addition states that OR
ing more than two variables i.e.
mathematical addition operation
performed on variables will return the
same value irrespective of the grouping of
variables in an equation.
It involves in swapping of variables in
groups.
The Associative law using OR operator can
be written as
A+(B+C) = (A+B)+C
Associate Law of Multiplication
Associative law of multiplication
states that ANDing more than two
variables i.e. mathematical
multiplication operation performed
on variables will return the same
value irrespective of the grouping
of variables in an equation.
The Associative law using AND
operator can be written as
A * (B * C) = (A * B) * C
Distributive law
This is the most used and most important
law in Boolean algebra, which involves in 2
operators: AND, OR.
The multiplication of two variables and
adding the result with a variable will result
in same value as multiplication of addition
of the variable with individual variables.
In other words, ANDing two variables and
ORing the result with another variable is
equal to AND of ORing of the variable with
the two individual variables.
Distributive law can be written as
A + BC = (A + B)(A + C)
Commutative law

Commutative law states that


the inter-changing of the order
of operands in a Boolean
equation does not change its
result.
Using OR operator → A + B = B
+A
Using AND operator → A * B = B
*A

Absorption Law

Absorption law involves in linking


of a pair of binary operations.
i. A+AB = A
ii. A(A+B) = A
iii. A+ĀB = A+B
iv. A.(Ā+B) = AB
3rd and 4th laws are also called
as Redundancy laws.
De Morgan’s Theorem
Boolean algebra involves in binary addition,
binary subtraction, binary division and
binary multiplication of binary numbers.
 Similar to these basic laws, there is
another important theorem in which the
Boolean algebraic system mostly depends
on. That is De Morgan’s law.
De Morgan’s Theorem
(A.B)’ = A’ + B’
(A + B)’ = A’.B’
De Morgan’s Theorem
Statements
Statement 1:
“The negation of conjunction is the
disjunction of the negations”. Or we can
define that as “The compliment of the
product of 2 variables is equal to the sum
of the compliments of individual variables”.
(A.B)’ = A’ + B’
Statement 2:
“The negation of disjunction is the
conjunction of the negations”. Or we can
define that as “The compliment of the sum
of two variables is equal to the product of
the compliment of each variable”.
The truth table for De Morgan’s First statement
The De Morgan’s laws are simply
explained by using the truth tables.
The truth table for De Morgan’s first
statement((A.B)’ = A’ + B’) is given
below.
So the De Morgan’s first law can also
be expressed as “not (A and B) is
equal to (not A) or (not B)”.
The truth table for De Morgan’s second
statement
The truth table for De Morgan’s second
statement.
So the De Morgan’s first law can also be
expressed as “not (A or B) is equal to(not
A) and (not B)”.
DeMorgan’s Theorem in Gates
The De Morgan’s theorem can be proved by
using basic logic gates such as AND gates
and OR gates.
For statement 1: (A.B)’ = A’ + B’
The output of a NAND gate (AND gate with a
NOT gate at its output side) is equal to
output of the gate formed by connecting two
NOT gates at the inputs of OR gate. This can
be said as,
NAND gate= Bubbled OR gate
DeMorgan’s Theorem in
Gates
For statement 2: (A + B)’ = A’.B’
The output of a NOR gate (OR gate with a
NOT gate at its output side) is equal to
output of the gate formed by connecting
two NOT gates at the inputs of AND gate.
This can be said as,
NOR gate= Bubbled AND gate
Boolean Functions
The binary variables and logic operations are
used in Boolean algebra. The algebraic
expression is known as Boolean
Expression, is used to describe
the Boolean Function.
The Boolean expression consists of the
constant value 1 and 0, logical operation
symbols, and binary variables.
Example 1: F=xy' z+p
We defined the Boolean function F=xy'
z+p in terms of four binary variables x, y, z,
and p. This function will be equal to 1 when
x=1, y=0, z=1 or z=1.
THANK YOU

You might also like