Boolean Logic is a form of

known as Boolcan Operators;algcbru

which is contered around three simple words
In Boolean Logic, all values are"OR,"AND,"
and "NOT
either trñe or lalsc.
Logical Operators:
Logical operators are derived from the Boolean algebru, which is the
mathematical representation of the concepts without going into the meaning ot
the concepts.
1.NOT Operator Operates on single variable. It gives the complement value
of variable.

2.0R Operator -lt is abinary operator and denotes logical Addition operation
and is represented by"M4" symbol
3. AND Operator - AND Operator perforn1s logical multiplications and symbol is
9 dot.

Basic Logic Gates

A gate is simply an electronic circuit, which operates on one or more signals to
produce un
output signal. Gates are digital circuits because the input and output signals are
eher low (0)
or high (1). Gates also called logie circuits.
There are three types of logic gates:
1. Inverter (NOT gate)
2. OR gate
3. AND gate

1. NOT gate : This gate lakes one input and gives a single output. The symbol of
this logic gate is
YX

This circuit is used to obtain the compliment of a value.

 XX
The truth table for NOT gate is : 0

2. OR gate : The OR gate has two or more input signals but only one oupu
signal if any of the input signal is I(high) the output signal is 1(high).
Truth Table and circuit diagram for Two Input OR gate is i
X Y

0 0 0

1 D
AND gate The AND gate have two or more than two input signals and
produce an outpüt signal. When all the inputs are 1(High) then the
output is 1otherwise output is 0 only.
Truth Table and circuit diagram for two input AND gate is :
X F=X.Y
0 0
1

-Z=XY

Truth table: Truth table is a table, which represents all the possible values of logical
variables/statements along with all the possible results of given combinations of
values.
Basic Theorems of Boolean Algebra :

1 Properties of 0 and 1

OR X (yale reresenlatlon of (o))

(6) 1 eale represenlatlon of (b)

OR 1
X

(c)0.-0 (gale teurcsenlation of (e)

AND

(91 (gate reresentation ef (d))

AND

Truth Table for 0 +X= X. Truth Toble for 0.X=0.

R
R
0 )
0 1

Truth table for 1+ X=1 Truth Table for 1.X=X

1X R 1 X R

1 0
0

2 Indempotence Law
This law states hat

X
X

and (b) . e l ic. X

AND
X

Truth Table for X+ X= X Truth Table for X.X =X

X X R X
0 0
1 1 1
1
 3 Involution law
This law states that

(X)=X i.e.,

Truth Table for X=X

X
0

0 1

This law is also called double-inversion rule.

4
Complemenlarity Low
These laws state that
(a) 1 - t X
(gate represcntation ef (9)

and ()0
AND XX=0 (çate representation of (b)

Truth Table for X+X=1

Truth table for X. =0
X+X
0 1 X.X
1
1
0

Tautology If the result of any

logical statement or expression is
always TRUE or 1, it is called
Tautology.
 Fallacy If the result of any logical
statement or expression is always
FALSE or Oit is called Fallacy.
In complementary laws,

XX1 is Tautology and x.X=0 is Fallacy

.5 Commutative Law
These laws state that

(a) X+Y -Y+X (b) X Y- Y.X

OR OR R AND AND
R
 6 Associotivo Law
Thesc laws state that
(a)X02N2
Le.
X
OR R
R OR
)OR
Y+Z

(0) X2(0D2
AND
AND Ry AND
AND
YZ

Truth Toble for X+(Y +2)=(X +Y)+2

YZ X*Y X+2)&)+2
1 1

)
.7 Distributive Low
This law states that
(a) X(Y Z)
XY XZ
X AND XY
AND R R
) OR Yz XZ
AND

(b) X- YZ-(X+ YYX + Z)

Lo.,
R
AND
R
AND
Y.Z

(a) Truth table for X(Y + Z) =XY+XZ is given below :

X Y+Z XY X2 XY+Z) XY+X7
0 0
1 0
1 1 ) 0
0 1 1
0 0
1 0 1 1 1
1
1
1
1 1 1
1 1 1

Both the columns X(Y+ Z) and XY+ YZ are identical, hence proved.

the algebraic proof of law X+YZ=(X+YX+)

R.H.S. =(X+Y)(X+)= XX+ XZ+ XY + YZ
-X+ XZ+ XY+ YZ (X =X ndempotence lu)
-X+ XY+ XZ+ YZ= X(1+Y+XZ+YZ
=X1+ XZ+YZ (1+Y =lproperty of 0and 1)
-X+ XZ + YZ
(X.1=X property of 0and 1)

-X(1+Z)+ YZ
=X1+ YZ
(1+Z=lproperty of 0and 1)
-X+ YZ (X.1=X property of 0 and 1)
-L.H.S.

Hence proved
 8 Absorplion Low
Avnting lo this lasw
(a) N ) 1
Proof
LH.S.=X+ XY
(b) X(X + Y)=X
(a) X+XY=X
- X(1+ Y) LHS. =X(X+ Y) =X. X+ XY
-X.X+XY
Putting 1+Y=l
(ref i =X+ XY
X.1=X-RH.S, (X.X N: Indenmpotence Lao)
=X(1+ Y)
-X.1
(using 1+Y=lproperties of 0, 1)
-X
(X.1=X using property of 0, 1)
-R.H.S Hence proved.

1.
Praerties of 0 0-X: 0..N=0
Booleon Algebro Rules 2 Propertios of 1 +=1:
3 Indempotenec laa
Inzdutim

5.
Comylemestarity Lates .0
6 Conmutalise laue .=.

7. Assxiat lza A+0+Z) =(X+n+Z;

8. Distrbutine lau

9. Absortin lat

10, Otlher
(3rd distributice laze)