Chapter 3 : Boolean Logic

In the year 1854, George Boole, an English mathematician, proposed this algebra. This is a variant of
Aristotle’s propositional logic that uses the symbols 0 and 1, or True and False.

Boolean Algebra
The branch of algebra that deals with binary operations or logical operations is called Boolean Algebra.
It was introduced by George Boole in the mid 19th century.

Boolean Variables
Variables used in Boolean algebra that store the logical value of 0 and 1 are called the boolean
variables. They are used to store either true or false values.

Boolean Function
A function of the Boolean Algebra that is formed by the use of Boolean variables and Boolean operators
is called the Boolean function. It is formed by combining Boolean variables and logical expressions such
as AND, OR, and NOT.

Truth Table
Table containing all the possible values of the logical variables and the combination of the variable
along with the given operation is called the truth table. The number of rows in the truth table depends
on the total Boolean variables used in that function. It is given by using the formula,
Number of Rows in Truth Table = 2n
where “n” is the number of Boolean variables used.

Boolean Operation
1. NOT Operator
2. OR Operator
3. AND Operator

NOT Operator: Using the NOT operation reverse the value of the Boolean variable from 0 to 1 or
vice-versa. This can be understood as:
● If A = 1, then using NOT operation we have (A)’ = 0
● If A = 0, then using the NOT operation we have (A)’ = 1
● We also represent the negation operation as ~A, i.e if A = 1, ~A = 0

AND Operator: Using the AND operation satisfies the condition if both the value of the individual
variables are true and if any of the values is false then this operation gives the negative result. This can
be understood as,
● If A = True, B = True, then A . B = True
● If A = True, B = False, Or A = false, B = True, then A . B = False
● If A = False, B = False, then A . B = False

OR Operator: Using the OR operation satisfies the condition if any value of the individual variables is
true, it only gives a negative result if both the values are false. This can be understood as,
● If A = True, B = True, then A + B = True
 ● If A = True, B = False, Or A = false, B = True, then A + B = True
● If A = False, B = False, then A + B = False

Venn Diagram of Boolean Operators

Logic Gates: A logic gate is an electronic circuit which takes one or more than one input but only
produces one output. The output of a logic gate depends on the combination of inputs and the logical
operation that the logic gate performs.

Basic Logic Gates

AND Gate : The AND gate is one of the basic logic gates that performs the logical multiplication of
inputs applied to it. It generates a high output, only when all the inputs applied to it are high. Otherwise,
the output of the AND gate is low. It is denoted by dot(.).

Example : A.B

Truth table:

A B A AND B

0 0 0

0 1 0

1 0 0

1 1 1

Symbol of AND gate

OR Gate: The OR gate is also one of the basic logic gates. It generates a low output, only when all the
inputs applied to it are low. Otherwise, the output of the OR gate is high. It is denoted by Plus(+).

Example : A+B

Truth table:

A B A OR B

0 0 0

0 1 1

1 0 1

1 1 1

Symbol of OR Gate

NOT Gate: The NOT gate is another basic logic gate used to perform complement of an input signal
applied to it. It takes only one input and one output. Therefore, if we apply a low output to the NOT gate
it gives a high output and vice-versa. The NOT gate is also known as an inverter, as it performs the
inversion operation. It is denoted by Bar(Ā).

Example : Ā

Truth table:

A Ā

0 1

1 0

Symbol of NOT Gate

NOR Gate: The NOR gate is a type of universal logic gate which is basically a combination of two basic
logic gates i.e., OR gate and NOT gate. Thus, it can be expressed as,
NOR Gate = OR Gate + NOT Gate
In other words, a NOR gate is an OR gate followed by a NOT gate. A NOR gate gives a high output only
when it's all inputs are low.

Truth table:

A B A NOR B

0 0 1

0 1 0

1 0 0

1 1 0

Symbol of NOR Gate

NAND Gate: The NAND gate is another type of universal logic gate which performs the inverted
operation of the AND gate. The NAND gate is also represented as a combination of two basic logic
gates namely, AND gate and NOT gate. Hence, it can be expressed as

NAND Gate = AND Gate + NOT Gate

In other words, a NAND gate is an AND gate followed by a NOT gate. NAND gate produces a low
output only when its all inputs are high.

Truth table:

A B A NAND B

0 0 1

0 1 1

1 0 1

1 1 0

Symbol of NOR Gate

XOR Gate: The XOR Gate can also have two or more inputs but produce only one output signal. The
output of XOR gate is high only for those input combinations that have an odd number of high inputs. It
is denoted by symbol “⊕” and is written as A⊕B

Truth Table
For 2 Inputs For 3 inputs

A B A⊕B A B C A⊕B⊕C

0 0 0 0 0 0 0

0 1 1 0 0 1 1

1 0 1 0 1 0 1

1 1 0 0 1 1 0

1 0 0 1

1 0 1 0

1 1 0 0

1 1 1 1

Symbol of XOR Gate

XNOR Gate: The XNOR Gate can also have two or more inputs but produce only one output signal.
This gate is logically equivalent to an inverted XOR i.e., XOR gate followed by a NOT gate. Thus output
of XNOR gate is high only for those input combinations that have an even number of high inputs.

Truth Table
For 2 Inputs For 3 inputs

A B A⊕B A B C A⊕B⊕C
 0 0 1 0 0 0 1

0 1 0 0 0 1 0

1 0 0 0 1 0 0

1 1 1 0 1 1 1

1 0 0 0

1 0 1 1

1 1 0 1

1 1 1 0

Symbol of XOR Gate

Basic Postulates of Boolean Algebra

● If X is not equal to 0, then X = 1; and if X is not equal to 1 then X=0.
● 0 + 0 = 0 ; 0 + 1 = 1 ; 1 + 0 = 1 ; 1 + 1 = 1 (OR Relation)
● 0 . 0 = 0 ; 0 . 1 = 0 ; 1 . 0 = 0 ; 1 . 1 = 1 (AND Relation)
● Complement Rule : 1’ = 0 ; 0’ = 1.

Principle of Duality
This principle states that every Boolean expression has a dual expression which can derived by:
1. Change each OR sign by an AND sign and vice-versa.
2. Complement any 0 or 1 appearing in the expression.
3. Keep literals as it is.
For Example, 1+P = 1 has a dual as 0.P = 0 (as per the above rules).
In Boolean Algebra, if an expression is true, its dual will also be true and vice-versa.

Other Theorems or Law of Boolean Logic

Law OR form AND form

Identity Law P+0=P,P+1=1 P.0=0;P.1=P

 Idempotent Law P+P=P P.P = P

Commutative Law P+Q=Q+P P.Q = Q.P

Associative Law P + (Q + R) = (P + Q) + R P.(Q.R) = (P.Q).R

Distributive Law P + QR = (P + Q).(P + R) P.(Q + R) = P.Q + P.R

Inversion Law or
(A’)’ = A (A’)’ = A
Involution Law

Absorption Law P + P.Q = P P. (P + Q) = P

Complementarity Law P + P’ = 1 P. P’ = 0

Other (3rd Distributive

P + P’.Q = P + Q P + P’.Q = P + Q
Law)

De Morgan’s Law (P + Q)’ = (P)’.(Q)’ (P.Q)’ = (P)’ + (Q)’

De Morgan’s Law
De Morgan’s Law is one of the most powerful identities used in boolean logic. Augustus DeMorgan had
paved the way to boolean logic by discovering these two important theorems.

DeMorgan’s First Theorem

It states that (A+B)’ = A’.B’
Proof: To Prove this theorem, we need to recall complementarity law, which states that the sum of a
variable and its complement is 1 and their product is 0
A + A' = 1 and A. A’ = 0
So according to 1st condition (A + B) + (A +B)’ = 1 i.e., (A+B) + (A’.B’) = 1 and
According to the 2nd condition (A + B).(A+B)’ = 0 i.e., (A + B)(A' . B') = 0.

Considering the 1st Case:

(A + B) + (A' . B') = 1

L.H.S = (A + B) + (A' . B')

= (A + B + A')(A + B + B') [Distributive Law]
= (1 + B)(1 + A) [A+A'=1 and B+B'=1]
= 1.1
 =1
L.H.S = R.H.S So the 1st case is proved.

Considering the 2nd case:

(A + B)(A' . B') = 0
L.H.S = (A + B)(A' . B')
= A.A'.B' + B.A'.B' [Distributive Law]
= 0.B' + 0.A' [A.A'=0 and B.B'=0]
=0+0
=0
L.H.S = R.H.S So the 2nd case is proved.
Thus, (A+B)’ = A’.B’

DeMorgan’s Second Theorem

It states that (A.B)’ = A’ + B’
Proof: To Prove this theorem, we need to recall complementarity law, which states that the sum of a
variable and its complement is 1 and their product is 0
A + A' = 1 and A. A’ = 0
So according to 1st condition (A.B) + (A.B)’ = 1 i.e., (A.B) + (A’+B’) = 1 and
According to 2nd condition (A.B).(A.B)’ = 0 i.e., (A.B)(A' + B') = 0.

Considering the 1st Case:

(A.B) + (A’+B’) = 1
L.H.S = (A.B) + (A’+B’)

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

= (A’ + B’ + A).(A’ + B’ + B) …. Distributive law
= (A + A’ + B’).(A’ + B + B’)
= (1 + B’).(A’ + 1)
=1.1
= 1 = R. H. S

Considering the 2nd Case:

(A.B)(A' + B') = 0
` L.H.S. = (A.B).(A’+B’)=0
= (A.B.A’) + (A.B.B’)
= (A.A’.B) + (A.B.B’)
= 0.B + A.0
=0+0
= 0 = R.H.S.
Thus, (A.B)’ = A’ + B’
Hence Proved.

Circuit Diagrams are also part of the syllabus.