Boolean Logic

Boolean Logic - It is a form of algebra in which all values are reduced to either
1(True) or 0(False). It was developed by George Boole.

Binary Decision - The decision which results in either yes (True) or No (False)
is called Binary decision.

Truth Value - The values True and False are called Truth Values

Boolean Variable - They are the variables that stores either True or False

Logical Operator
NOT Operator - This operator operates on a single variable and it gives the
compliments of a given variable. It is represented by ‘-’ (bar).
Ex-
X X|
0 1
1 0

OR Operator - This operator performs a logical addition operation on two

operands. It is represented by ‘+’ (plus).

X Y X+Y
0 0 0
0 1 1
1 0 1
1 1 1

AND Operator - This operator performs a logical multiplication operation. It is

represented by ‘.’ (dot).

X Y X.Y
0 0 0
0 1 0
1 0 0
1 1 1
Boolean Expression - It is a logical statement that results in either True or
False.

Tautology - If the result of any logical statement or logical expression is always

True or 1 for all input combinations then it is called a tautology.

Fallacy - If the result of any logical statement or logical expression is always

False or 0 for all input combinations then it is called a Fallacy.

Truth Table - It is a table that represents all the possible values of logical
variables/statements along with all the possible results of the given combination
of values.
|
TRUTH TABLE: X .Y
X Y X| X|.Y
0 0 1 0
0 1 1 1
1 0 0 0
1 1 0 0
|. | |. |
(A D )+ B.(C D )

A B C D AI C| D| AI D| CI D| B( CI D|) (A|. D|)+

B.(C|. D|)
0 0 0 0 1 1 1 1 1 0 1
0 0 0 1 1 1 0 0 0 0 0
0 0 1 0 1 0 1 1 0 0 1
0 0 1 1 1 0 0 0 0 0 0
0 1 0 0 1 1 1 1 1 1 1
0 1 0 1 1 1 0 0 0 0 0
0 1 1 0 1 0 1 1 0 0 1
0 1 1 1 1 0 0 0 0 0 0
1 0 0 0 0 1 1 0 1 0 0
1 0 0 1 0 1 0 0 0 0 0
1 0 1 0 0 0 1 0 0 0 0
1 0 1 1 0 0 0 0 0 0 0
1 1 0 0 0 1 1 0 1 1 1
1 1 0 1 0 1 0 0 0 0 0
1 1 1 0 0 0 1 0 0 0 0
1 1 1 1 0 0 0 0 0 0 0
Logic gates: A Gate is a circuit which takes one or more inputs
and generates an output s.

Type of Logic Gates

NOT Gate : NOT gate has only one input signal and one output
signal. The output is always opposite of the input signal.
X |
X
XX
X X|
0 1 X
1 0

OR Gate: The OR Gate has two or more input signals but only
one output signal. If any of the input is high (1), the output signal
is high (1).
X F
X Y F=(X+Y) Y
0 0 0
0 1 1
1 0 1
1 1 1

AND Gate: The AND Gate has two or more input signals but only
one output signal. If any of the input is low (0), the output signal is
low (0). X
F
X Y F=(X.Y) Y
0 0 0
0 1 0
1 0 0
1 1 1
NOR Gate: The NOR Gate has two or more input signals but only
one output signal. All input signals must be low (0) to get a high
(1) output signal.
X
F
| Y
X Y F=(X+Y)
0 0 1
0 1 0
1 0 0
1 1 0

NAND Gate: The NAND Gate has two or more input signals but
only one output signal. All input signals must be high (1) to get a
low (0) output signal.
X
F
| Y
X Y F=(X.Y)
0 0 1
0 1 1
1 0 1
1 1 0

XOR Gate: The XOR Gate has two or more input signals but only
one output signal. Its produces output high (1) for only those input
combinations that have odd number of 1’s.
X Y F=(X Y)
X
0 0 0 F
Y
0 1 1
1 0 1
1 1 0
De-Morgan’s Theorem:
|
i) (X.Y) = X| + Y| -The complement of a product is equal to the sum of
complement.
|
ii) (X+Y) = X|. Y| - The complement of a sum is equal to the product of
complement.