to

Tatrodueion to oiseve le Mathe atica

Davele matherates i a bmnch ot rathermatica

hich is oidely
usd in sludying ard dislnibbing the
cbjects and proble ms in broanehes of Computer Sience
steh as computer alqovithms, prtqyarnming tanqunges,
pic oqyaphy o Acto mated theovem and slw develop mant.
Mathemabead Loqie i -

Loqic is aa discipline hich deals itb methods t

veasoring loqical ea soring is used in computer Science
to
Nerify thne coretness of
ehatement or Preposi bion ;
Statnent is a declarahve Sentence that is either
False but not the bot:

weeh (1)
) A leek has more uunber o days than a nonth
False (D)
3). 5 I9 a prime number ’T y 1)

statmurt prepoci bon.

Logical connecivity
Tt Can be deseribed ns ht. opevatovs that
(onnect one ox more than One preposition . le kave Rity.
basic conn¬civeg

Name of (onneeive
Conneciveg word Symbol
Negation NOT

AND
corjunghion V
diejunchion
Conditinal it then
Bi Condi icnal t, ,

Negalien: when Pie -brse thun negahon

when p is False then neqation e is True.
Truth toaole :
e: P: tt is vuning
p: It is not raiing
T
P: at3 :5

Con juncion
when p,q, ave True then p and q, (pAg) il be Trut.
Truth Table:
Exanple!

t
9: It 19 cool
S: Paq,: It is aiing and co0l
Pnq, : T
oiajunchon
are Falge
when P,4
Trcth-table:
example

Conditional Trçlicaion:
Ttp is Trae, q, is false then imlicahon of tnen
uol) be Fal.
Cxample :
Tructh table : p: Ttis vag

P . F:

Bicon ditional or
&iTmplicabon
(<5) o( ) ()

then of them wll be True

,:T thn P9:T
 ile tite

Yeod as

-e bicondi tional q,
’p doubleinplies q

it ig
eas: If it is vidng hen it is cool, if
then it is vau ning
is Cool.
P<>: tt is aining if and only If it

7 Types of freçosibon; There ore too types

Atornic prepoiion Sitrple pre çoition or prngy
preposititn or prinitbve preposihion.
2 Compound freposition.
’ Alomic reçoiion
further.
It i3 preposition shich canrot be divided
(G-e doge not contuin ay onneehves), Such a AV,,

) 5 i% a prime nuber (T)

@) Munba is a capital of Lndia (F).
 Compound freposition:

ion Here we are uging connecliveg. Suh as:

A, V , ~ , .

,.6 is a prime umber and nunbai is a capits

of India (T)

s). Canatnuc a uthtable for each Compaund

prepositiðn;: ) Pa(ayvq4)

T T T
T
T

T T

i) ~eve) v (~pnn4)

T
T

T
T T F T

’Wite the tuth table for: ) (pv)ng

 05l0a)1025
Truthtoble Poy
fov
9 Constuct

p-’ (aq, v ).
p (qv )
T T

T
T T

T
T
T T

F T

T
F T T
T
F

T T
T T
T
T T T

T T

F T T T T
1
F T T

Loqical Equivalence:
The Comçound preposihons that have Hne Sane tuth
Values in al poitble Cases ave called Loqica' eaivalence
Tautology!
Compond position calted unta
The

Loqical equuvalent of a ccmpound preposrions

o
eand 4 19 denoted by p= 4 (0)

T T

(O1)
T T
P

logieal
eqyuivalance

) Rrove oqica! equivalance ot

Cqiven :e,,~e, ~9,pan,Pag,

T
T

T
Tauto logy

F T

gied quivalance
 Srow that P and lp)v4 ave

(p)v
T 1
T
T
T T

T
Tautolgy
T

of the
We obeve that th colunn y and alboe
4akle loaye the iden tcal uth values in all powh.

e" For any tuuo preç0sitions p and q, prove hat

T T T
T T T T
T

T
T T Tautoloqy
T

T T T T T

T T T T
Tacuto legy
T T T

T
 3

A<d)][uk v

<
L

T1

u-d)(a-b)v
L
 the called etatement
is Onigìnal th oF
convere the
tazing cbtained
by statmnt Contagoitive
The : iD
th
Pq, converse
of The Converse )
qre P>4 elated
topreçoibos Condihonal
thin two Chy and PTf
huv comtprepotions. are
Taverge. positve, Contra Converse 7
Taubalagy
T T
T
T
T
T
T
T F
T T T
T T
T T
T
T
T T T T
TT
F
TTT
P9,
 ie he Conba poitive of -
P , 19'q, p
) Tnvev3e: he inverse of
Tuth table :
,(onditional Converge Inverse (ontra tve
P
T T
T
T

T T

Example :
Considler the statnens

slates that :

P-4: II tatns then the Cop ll qreuw

7lhe Convexse of: P’4 naylbe stats that :

has be vain.
1} the Crops qrow, Then there

’ The contaeoitie of stat tht:

pi If the Crops donot then thure has been

no Yavn.

he Tnve se of p nanely statnthat i

T 7 i If it does not xaio the epe% oill not
Agebra of prepesitiong : (loss of loqic) :
I" Tdempotent tauo: PVP=e PAe =P
2 Aociatve law:

3. Commutative law

4. Dfebbuive laus

5. Tdentity lauw:

4. Complement lauo:

tb). nf T

3hvolution Louw:neg
 Rerived Connechves:

negaben
! NAND: IB tneans neqaon of corjeien ot
P and 4, be two prept2 bcns
NAND of P and q, is
shun both P and True Otherwi True It i3
nencted P^ and

P
T T
T

T
T

mean tuo
statarnant Avrre p and q, be t c repeiions
prepoibens hs Tue
cben beth e and q, are False'. otae True Itis

T 1T

sas p and a, be to prepobons

a15 True hen eaty One Bf P and iS rue

but not koth and it i88 False othurie.

6).

(e-*ar))-> ((es ) -’ (e)) (Taakoloys

(ov)ha Palvar)) v(~Pan)vr
 vd(uvb)

bamy
 C~pA)

(pn)v

v
(nqv)

T F
Tautalegy
Cev4))aapA

T F

T T
(pA)

v
T (~fAn)
F T

T T T T

T F F T

F T F

T F T
 formila' i3 an expre Kion wtich
A statament
contains aSyaeol, statenend, conneelivihy batev
Symeols, variable and pavanthse.
ctalment formue Can aleo be. aled ass hlEE
well formed for qeraded oy
felloing les;
L. A statment varvable tandinq alone is wlfF WEF
IEE then aleo
3. IÉ A and well fomed rnua n
-A and B, (An), CAVe), (A-26), (ne> e) e
also oel Fomd Fomulae
Examples of ell Forned Formulac

Eample of not wel foned fonlae

6-ithet uing tuth tablec place the fotlouoig

 tollo -AMoLiaive
law:
pul
prove
the lao:
Qemorgan
tables
tuth
the R)
~pv(9 (ngvr)
pv)n
(wevg)
vR
ueing eng)VY
without
 the uth table
9:Aithout usihg the iellowry

(pas) v(rpas) v (pang)

((pvp)a)(eA ng)
(Tng) (ag)
9 v(pa )
(gvp) c9ng)
= RH

(pnCgne))v (9AR) v (PAR) R -

Guven apn nR)) V(gnr)v(paR)

(hpnng) na) v((gvp) ^R)

(alpvg) AR) v ((gve) AR)
(u levg) AR) ((pvg) nR)

RHS
 (PnG) A~(phlnvn))) v (opang)vip
prove the above is a tautology
 Contradiction :
a Conçtund prepos1ien
prepos1lien et is loays fale tr all
rossiele valueg ile variables or in otker oercds tortaur
lu f,In Hoe last colnn of a truth table cled
&conthadictien.
continqency
Compound
preposition that i neither a tautalog y
ordvadichien is called contingency
NOte;

s The neqton oF a conbradicion is a tautaleg y

2 Astateme nt formula aohich is a tautalogy ts idents.
cally trie and a for mloa wchis a contradichen is
dentically False.
g verify the preoibion pA(3ap): cortyadichon
pa lg1np)
F
T conbsadicticoo.
T T
T.
T

Paq, P (p)>(pA4)
T

T tonkingeny
 oo are Gad
fommulas, Aand A
ach other if eithe oné Can be dokained from the

oy veplaelng n by v and v by a

also colled duale o

These comecves A and V
ench other.
Also if the fomala A ha true T) or F (Fala'
then * dual t
bu al,
i9 ootained by veplaeing Trut by
and False True. Ih addiion to
the aloove menbened
by
interckargea
4: (eag)v(rA)

’ find the duale of

(pv)a
(,413)

N) 1(pn4,) v(ev 1v1s))

lhe odandavd forms catled conoru cal forns or
Nonal -formo
an
t ol
uoll ke (Onvinue
corvinie nt to ue the oovds procet
um in lace of loqical conne ehives conyunchor tnd
junien.
are clasitied into tu0 types
Dis junchive normal fovm (ONE) ’
Cenyuneve nermal forn CcE) ’ ( produt

’Disjunctive norma Form:

Aformala chih s eaialent to the atven formula
and uchich consists
Conggts of oa Susn of elementay product is
v
Caled DNF.

Elerentary produet: A product ef Voralles and

tuir neqaions in a formla is Caled an elementary
produet

L of oNF :

’ (PAg)v (paR)
Conuncive Nomal formn ;
A foxmla hib i enyuvalent to the qiven t
and anhith conis b o¢ a psccuet of de mentay
( aled CNF .

> Elementary Sun: Sun of Vaiables and thir

in a formula is caled an elementan Bun.

(Pvg), pvg) , (ev ng), (np VR).

9. Ootain the digunchve nevmal -form of the folou

i) PA e -29)

(PAnp)v (pA) un of elenmentary prodazts.

~tpvg) (pag)
Rules :
frocedårs to cbtarn a qiven loqical
logienl expr
éxfr
Teree eteps reauied to obtato a oNF thrcugh
aiqetro't mandpulatien8
Reneve al Lingles) and
Drtainurghe connechives
by an equivalent expreien containdng
ay' and cnsy
eramele : p-4 i Yephced by npv
Pe4 is ve plaeed by (eaq) v(npan)
Oy)

(npna)v (noyn).
Eleninat negaion befeve ms and preduets by
using the double negahien er by ucing the demovqars
law

) Apply the digtibtve las unil a Sum f elemert.

ay product is obtuned.