Basic laws of Boolean algebra

What is Boolean Algebra?

Boolean algebra is a different kind of algebra or
rather can be said a new kind of algebra which was invented by world-famous mathematician
George Boole in the year of 1854. He published it in his book “An Investigation of the Laws of
Thought”.
Boolean algebra or switching algebra is a system of
mathematical logic to perform different mathematical operations in a binary system. There only
three basis binary operations, AND, OR, and NOT by which all simple, as well as complex
binary mathematical operations, are to be done.
There are many rules in Boolean algebra by which
those mathematical operations are done. In Boolean algebra, the variables are represented by
English Capital Letter like A, B, C, etc and the value of each variable can be either 1 or 0,
nothing else.

In Boolean algebra, an expression given can also be

converted into a logic diagram using different logic gates like AND gate, OR gate and NOT gate,
NOR gates, NAND gates, XOR gates, XNOR gates, etc.
Some basic logical Boolean operations,

AND Operation:-

OR Operation:-
Not Operation:-

Some basic laws for Boolean Algebra:-

A . 0 = 0 where A can be either 0 or 1.

A . 1 = A where A can be either 0 or 1.

A . A = A where A can be either 0 or 1.

A . Ā = 0 where A can be either 0 or 1.
A + 0 = A where A can be either 0 or 1.
A + 1 = 1 where A can be either 0 or 1.
A+Ā=1
A+A=A
A + B = B + A where A and B can be either 0 or 1.
A . B = B . A where A and B can be either 0 or 1.
 The laws of Boolean algebra are also true for more than two variables like,

Cumulative Law for Boolean Algebra:-

According to Cumulative Law, the order of OR operations and

AND operations conducted on the variables makes no differences.

Associative Laws for Boolean Algebra:-

This law is for several variables,
where the OR operation of the variables result is the same through the grouping of the variables.
This law is quite the same in the case of AND operators.

Distributive Laws for Boolean Algebra:-

This law is composed of two operators, AND and OR.

Let us show one use of this law to prove the expression:-

Proof:-
DeMorgan’s Theorem:-
Two theorems that are an important part of Boolean algebra
were proposed by DeMorgan.

The first theorem states that the complement of a product is

equal to the sum of the complements.
That is, if the variable are A and B, then A̅B̅ =A̅+B̅

The second theorem states that, the complement of a sum is

equal to the product of the complements.

In equation form, this can be written as:- A̅+̶B̅ = A̅.B̅

Prepared by Sudip Dalal(Lecturer), Dept. Of ETCE, BPIE, Bishnupur