BOOLEAN ALGEBRA

Boolean algebra is the category of algebra in which the variable’s values are the truth values, true
and false, ordinarily denoted 1 and 0 respectively. It is used to analyze and simplify digital circuits
or digital gates. It is also called Binary Algebra or logical Algebra. It has been fundamental in
the development of digital electronics and is provided for in all modern programming languages.
It is also used in set theory and statistics.

The important operations performed in Boolean algebra are – conjunction (∧), disjunction (∨),
and negation (¬). Hence, this algebra is far way different from elementary algebra where the
values of variables are numerical and arithmetic operations like addition, subtraction is been
performed on them.

Boolean Algebra Operations

The basic operations of Boolean algebra are as follows:

• Conjunction or AND operation

• Disjunction or OR operation
• Negation or Not operation
Below is the table defining the symbols for all three basic operations.

Operator Symbol Precedence

NOT ‘ (or) ¬ Highest

AND . (or) ∧ Middle

OR + (or) ∨ Lowest

Suppose A and B are two Boolean variables, then we can define the three operations as;

• A conjunction B or A AND B, satisfies A ∧ B = True, if A = B = True or else A ∧ B =

False.
• A disjunction B or A OR B, satisfies A ∨ B = False, if A = B = False, else A ∨ B = True.
• Negation A or ¬A satisfies ¬A = False, if A = True and ¬A = True if A = False

Boolean Expression
A logical statement that results in a Boolean value, either be True or False, is a Boolean expression.
Sometimes, synonyms are used to express the statement such as ‘Yes’ for ‘True’ and ‘No’ for
‘False’. Also, 1 and 0 are used for digital circuits for True and False, respectively.

Boolean expressions are the statements that use logical operators, i.e., AND, OR, XOR, and NOT.
Thus, if we write X AND Y = True, then it is a Boolean expression.

Boolean Algebra Terminologies

The important terminologies is as follows:

i. Boolean Algebra: Boolean algebra is the branch of algebra that deals with logical
operations and binary variables.
 ii. Boolean Variables: A Boolean variable is defined as a variable or a symbol defined as
a variable or a symbol, generally an alphabet that represents the logical quantities such
as 0 or 1.
iii. Boolean Function: A Boolean function consists of binary variables, logical operators,
constants such as 0 and 1, equal to the operator, and the parenthesis symbols.
iv. Literal: A literal may be a variable or a complement of a variable.
v. Complement: The complement is defined as the inverse of a variable, which is
represented by a bar over the variable.
vi. Truth Table: The truth table is a table that gives all the possible values of logical
variables and the combination of the variables. It is possible to convert the Boolean
equation into a truth table. The number of rows in the truth table should be equal to 2n,
where “n” is the number of variables in the equation. For example, if a Boolean
equation consists of 3 variables, then the number of rows in the truth table is 8. (i.e.,)
23 = 8.

Boolean Algebra Truth Table

Consequently, if we express the above operations in a truth table, we get;

A B A∧B A∨B

True True True True

True False False True

False True False True

False False False False

 A ¬A

True False

False True

Boolean Algebra Rules

The following are the important rules used in Boolean algebra.

• Variable used can have only two values. Binary 1 for HIGH and Binary 0 for LOW.
• The complement of a variable is represented such that complement of B is B¯, Thus if B =
0 , B¯ = 1, and vice-vica.
• OR-ing of the variables is represented by a plus (+) sign between them. For example, the
OR-ing of A, B, and C is represented as A + B + C.
• Logical AND-ing of the two or more variables is represented by writing a dot between
them, such as A.B.C. Sometimes, the dot may be omitted like ABC.

Laws of Boolean Algebra

There are six types of Boolean algebra laws. They are:

• Commutative law
• Associative law
• Distributive law
• AND law
• OR law
• Inversion law
Those six laws are explained in detail here.

Commutative Law
Any binary operation which satisfies the following expression is referred to as a commutative
operation. 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

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)

AND Law
These laws use the AND operation. Therefore they are called AND laws.

• A .0 = 0
• A.1=A
• A. A = A
• A.A¯=0

OR Law
These laws use the OR operation. Therefore they are called OR laws.

• A +0=A
• A+1=1
• A+A=A
• A+A¯=1

Inversion Law
In Boolean algebra, the inversion law states that a double inversion of a variable results in the
original variable itself.
 • A¯¯= A

Boolean Algebra Theorems

The two important theorems that are extremely used in Boolean algebra are De Morgan’s First law
and De Morgan’s second law. These two theorems are used to change the Boolean expression.
This theorem basically helps to reduce the given Boolean expression in the simplified form. These
two De Morgan’s laws are used to change the expression from one form to another form. Now, let
us discuss these two theorems in detail.

De Morgan’s First Law:

De Morgan’s First Law states that (A.B)’ = A’+B’.

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.

The truth table that shows the verification of De Morgan’s First law is given as follows:

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

The last two columns show that (A.B)’ = A’+B’.

Hence, De Morgan’s First Law is proved.

De Morgan’s Second Law:

De Morgan’s Second law states that (A+B)’ = A’. B’.

The second law states that the complement of the sum of variables is equal to the product of their
individual complements of a variable.

The following truth table shows the proof for De Morgan’s second law.

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

The last two columns show that (A+B)’ = A’. B’.

Hence, De Morgan’s second law is proved.

The other theorems in Boolean algebra are complementary theorem, duality theorem,
transposition theorem, redundancy theorem, and so on. All these theorems are used to simplify the
given Boolean expression. The reduced Boolean expression should be equivalent to the given
Boolean expression.
Example
Question 1: Draw a truth table for A(B+D).

Solution: Given expression 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
Practicing Assignment
Complementary theorem, duality theorem, transposition theorem, and redundancy theorem are all
theorems in Boolean algebra, and they are used to simplify the given Boolean expression. Write a
short note on them and compare their operation with that of De Morgan’s theorem.
.