0% found this document useful (0 votes)
40 views

Discrete Structure

This document discusses propositional logic, including logical connectives like negation, conjunction, disjunction, implication, biconditional, and double implication. It provides truth tables for logical statements and definitions of logical laws like tautology, contradiction, identity, domimance, complement, commutativity, distribution, association, absorption, double negation, and logical equivalences of conditional statements. Examples of translating statements between propositional logic and English are given. Quantifiers, predicates, domains, and rules of inference like modus ponens, modus tollens, hypothetical syllogism, and addition/disjunction elimination are also covered at a high level.

Uploaded by

vivekks.cs.23
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
40 views

Discrete Structure

This document discusses propositional logic, including logical connectives like negation, conjunction, disjunction, implication, biconditional, and double implication. It provides truth tables for logical statements and definitions of logical laws like tautology, contradiction, identity, domimance, complement, commutativity, distribution, association, absorption, double negation, and logical equivalences of conditional statements. Examples of translating statements between propositional logic and English are given. Quantifiers, predicates, domains, and rules of inference like modus ponens, modus tollens, hypothetical syllogism, and addition/disjunction elimination are also covered at a high level.

Uploaded by

vivekks.cs.23
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

(6-0H2024 Tue sday

PROPOSI TIONAL L0GlC

Collecien of decaxatine tatement that has eithen

Net

ine innplecation
double pieçation Bidiweciomal

negatien
P

T T

FF T

Lasacdi Aaplecation
QP
T T

T T

T T

Double çmplecatim:
P
T
T

Alwas falsei comin adich


TaLtolegt
Make Tyuth Tasle o Sevas lrow
Quesi.(P’ ) n p
1(rPV¬Q)) = P

Tuth P
Table: T HH
H
T Q.Tautolo gy or not
T T
T
T
T T

3aadume aiming R
5

Tdempotent laus PUP=p hungy


Tdenity Raw PUFp HappyHa
RS
LDmimant la PvT = T Sta
Ro8
Cemplement lau PVP T I ALLe is aick then Tt ii Hainingyiceveasa HAHa
commuutatius laus Alice is hungy heit happy
(CA¬D) v4cAD)
Dis t ' b t i e Raus pv(qnr) =(Pv4) n(pv) * Alex ¢ithes haue cat or dog
daaeciatiue law pv(qu; (pvq)vr Conitiomal statement
adsozption Raw PV(PAQ)= p Converáe i

LDouble negation tauw rirp) =P Lnvehei


btatement
ogcal equvaluceeie cenditionaltateuaeut IPisthue ama qis False thenOHLgimal
AF a l a e . t comrenAe
amd TnveHOe cte both tHLe
ee dame
that meams LontHapoaitise alwa
t t h alue as 9

P: 2atin Saie is dogical quivance.


tatemnu aMe eQal 4
Tuwo copound peopoitienal
t4 Alice Aeattng them lice bothAeAame th Value.
a nothuy
2 Bit: Bnay Digt
PAv áluee s eating < Hnt uny Biit,
Pre cedencei oEveuy comp connecied to uni network n working prop.
ite pA op. Pogic Whatprob youface?
SoP PX) Phedcate logic
first laut
t P(x)
nnixed eniegenct
e e t P(x) denote st atenent zP3 ALhatis twtth.
blrop. stasifiabll.Cempaund puop is saisgialle value o4 Plt) amd P(2)
P(4)2E =T Pl 2)=F
Lde its aHiable that
makd it thle, ottherwe tee()=T Domain (4,5,& - c0)
wwAen compoundpHopositien isfalse Oall Jz P(2)3TorE Domaun IR
yamy one
to
deristential quantfils
censpound phop is sAatisgild.
Pre conditlon_post condi tlon
Pogic depends om vatiable and pHePety.
T
Batisfy ateast one 2a y=b dwap conditians teh
Post
G:(Pv9)A (2v ¬7) A(? V1P) =X
Pv v) ^(7pv¬4V¬7)=Y 2combination
P= True
Megation of quantifier: "De Margan's dao)
# aP()= ttx¬P()

X
audu them
T
T T
fo wlich P(xis Fase.
T
FoH eey x Pl)utHle
T
T
T zr(27) 3x1(y)

tx(x²= 2)
tx+2)
Cat

Tronslate to cunq Lish:


P(X,y)iA Ltatement. X+y=y+2 whatis tuth C (c)= has co mputer
a e ot quantiication iHLty Pxy) T F CC, y)= z44 are friends

domain conaist h IR thene eists y Atudent buch that yhas cemnpten and
and ye guenda.
Assume Qy,2)is atatement. ty=zFind ttuth Topie egatim of mested:
domainIi yaue of quantiicatien i) tatylz Q(x,y,2) T
2. Thoe doeunteetawomen who hes toRen afiçht om
QAss wme P(zy) z+y=o ) Ayt Pray) E leueylinein the Nored Pw, 4) PLE,a) ight on a

me quanti i p l n t then oxcer doeLnt


matte Rules of TAerence

Iransaie: Modu& Ponens

bum of 2poi'uentegens is alway paiti en, Moduus tolens


Son. t P l ) Dexmain 1R.

P(X,y) ty=z
domain LOintegu) Hypothetical
yta>o) (y>0)’Y>o
ayeeogism
Ans.
P R
Diajuncton Pva
yogm
2.wer neal umben eCepto Aas
domain (B xy)
multpicaionimvele. Additon
0)
talaz0) ’ Ehy1) mpliçication paa
Cenjunctian
cortapositien ame equal.

P
|Resolution
TPV timpttu
thin

eq: sothat the dtatemnt premiaLa


(9) Nite popes tatetemen mo. ama pHopeHty sec.
than yeatenday
iis e dent go 4wimming them wil takea
as e take ntHithen we uil be heme p(q’P)
(T) reVvp)
Cencun is we wil be heme byy suneet PV(rqVpP)=True, TautologN contingeny
13. P P=T
RS (iv) fT T False
PR T.

T
T3. NO
21.c) (PAQ)’R)
-(PAQ) V-R
-PVQV~R
22
Flood destroys P()
o()
R()P(X) V Q(x))
Pirre d estsoys
(R) Tnsur, wiLpay R ()
Aep ealy ad S
-R)(tPa)Vrq(x)]

PVq rRVS t VS
QVS
Dota

Pao
Proofs!
this boDk,thenm
da eaueMy pHob. nmatthematics
2ASSLMe a = b
ye a'- ab
oede
you wAl leann aÀ a-b2= ab-b2
(atb) (a6)= bla6) Can't t coz
, 2 (a-b)atb-b) =o Canlt bein
cleno, coz deno.
Can't he o,
J. nivOMLAl Jnstamtiotien z P()
2: (2-a) (a- b) (X-c)
dunivedal generalizatien P) fon anbitnay e
..4x P()

3estential Tnutandiatien 3Atudentin thialas as mot Head a iok amd


:.PCOon Beme elemevic eene n this class paed the t xaminatin
teasstintial gealenalisationKjon Aomallemente Cencli homeeme who passed_1 eramhan't eae a book.
:eP() Solh R(X)!hase -B() -RCa)
6.UniveHAa ModA Ponn: t P ( Q ( ) P(a)Passed exam tecl)Pat,P() A
Pla) whee ais impo.d omay Pl) ’rR( )

B(X): Read book J Co) |rR() AP ())


Pla) P(x): Passed Qram
Rul
Al womn auetalented thenejo He Ria À talemted To Prove: 4 /P(x) ArBl))
29 C(a) > Pla)
3) -B(a) ecar
4) rlla) V P(a)
thensom au cs
(B(a8(a)
Shou that aueuMRaAt. 9 () Plx) 9()-8
PCa) a -B(a)

t(Dca) )
im)
Modw on CCm)
De

Paga

fremises|Agument:
(PAt)(rvs) -poncusion
forens Simplitteation
2
p
Ronen
4 (PAt) (rvs) (p nt)’ (rvs)
,.P OMods Tolens

lpA4) -PV-q

(PAt)(rvs) 7PVtVr
unttien syLo
pvt
mot terBott)
-PlVtV rvs PA-s
then ace uaheld and thee
=-tVr roining.
was a dHophy.(T) Trophy wau not held. , It is
So (rf Vrr)’(AT)
Additon: 1TV ¬H -(AH)
Resuet -lrFVrr) Tollens

2 ormad 5
Modus Poneos ;Simp'cation
Smplif
Mods Ponens nink to
lo (x) ’ ( R() VS(x))) ofhw’ (RT) Vs (Theu)
P
vO(Tue) V o (Thws)
1R(Te) ^ S(Tue) 1R(Tue) ^ 1S Thu
(pAt)rvs 10(Thwu)

'. R(Thuw)Conclesion o (Tue) V o(Thy)

diyuncie auylegiim. o(Tue) ’ R(Tue) V S(Tue) A


R(Tue)
n R(TLe) V s(Tue)) Dis Hun cyllog .
0Tue) VR (Thu)
otrue) Vo Thuu) ACThuu) VoThuu)
(S
t(o(2)’R(x)VS (x)) sn'+ I+ 4n un (n+)+I
entiL alway oda
0(Tue) Vo (Th) 2(2k+ 2K) +1
3 7R(Tu) ^ 1S (Tue) De morganb

2Proof byconap nisanter and m}2 àodd hen n


Prom O unvenas inatantiation: is odd.
5. o(Tue)’ R(Te) vs (Tue)
o(Th)’R (Tu) VsT) 3n+2 en 3n+2
= 2n+ nt2
6from) amd mods Tolen
24 a 2(n+)+n
0(T) R(uwVsTe) = 3(2k) +2
1(R (Tue) Vstue))
T 2(3k+)
70(Tue)
Lenmadiction: atleOt t oB Ony 22 days amiat e the
from and Diajunction sylogtm
o(TUe)VOCTu)

0(Th) Atalenuat Rande is eemtadici en whene hypethus

10tte)ttThu) amd mods Penen


R(TAe) VsCT)
7S(The) and () Gn'is tiue then nÀtive hecawe cenditional statement
s ni tie and m²itile can be proued p

P
#Diet froot
Proof by LAmtrapositubn
PA.onf by Lenraaiaiem
positiue. E
D miu mot poaitiue thena s mot mis tiue
atatement
hocaAe conditLenae
P’
m (2n+) Cohausue Proot by cas
P, nis enen |2 q²=81
Case T: 20b
Case TI: 49

m CaseI 4- 0T6 l6,36


2k-1- =2 [k-)+l Hypotheicoe Cale T! 50^ 5
Pa: 2k-l= odd
CawVI:
Pa: (2kiseen 9 (ak2) een yogn
PPPs
PP2 ama P’P3 PPs Proof by couneraam ple,
D0rect Proot
odd l t ak+1 1 Proof t stamalad
DNF:
me2k+l
nz 2k+2 2[ kt)
=9 2 (k+)) een. (Pv) (GUR)
CPAG) V (QAR) DNF

mu
ohaustiue Po0t! AU Cases! cant do ike
(PivPa vP3- vP n ) T (PVa) Gpv) ^ (PvQ)
T PAiG) (PAQ -(P A) v (¬pA ¬9)
clistributw elau
(Pi’)^( Pa ) A(34)-- A(Pn 4) HAPv(PV Q) A ( QVeVQlycorrect by
=fP V) A (PVQ)
(QVIP) ACGUP)
L4,9 l6,25,36, 49, 64, 81, 100 36t,
121, 144, l69, 196, l25 26,289324, 2j00 QV(TPAP) - DNE
PVGVe) A G VevQ)
A(VP)
Pormu ate about final deumal digt sque o dugt
and proot. (¬PV)ACPVG)
¬PVQV) = ()A(¬Pa)
Soln , 4,9, 6,5 unit place (¬pVQ VP) ^ (
2,3,4,8 e appeol e tpIace.
Iniegni asame m= l02+b uhere a amd b and +4 ane enen
t nd both Cy
nd y aue Dy 2 K
a s tega otasinas eem.
then both 2 and y ae

aivided by 10, yisodd or y s o d then +y2s


D.Q+R=d
C6 Feb2024
or
Friday
2K+|
let Theoy
X=even
Ac: CE NA(X>1)^(yt IN, ztN: yz-t’y=1 V2=1)e
number

Cyz 2s 2k= 2 (2sk) (2k+1) (29+) J2xeNy een nmbet dal eet
ty=a(stk) Yks +2k+23+[
odd
2K+2s+2
= 2(k++) even e (A-B) = 2eA and B
ontra diction
#uniqueness proof i o.AUB)AC =(Anc) VCA08) s l t , LHS RHS àlwbeet.
Ce(AUB) nC cAnc) UCANB
RoX Ao11e patulas ale, theoxomn mat be tuLe.
c e (A UB) ahd c
for Peoot :
Ghous th.at a and b are 2Ce A nC a t ANB
eal mmbesand atO Fue page
then there s unigue eal muumbch tthat
cE Aand c) o C A amdB)
aHtb=o
Soln aseb
E (AUB) AC
e-bla S=-ba
Elunique so Sir's (AUB) AC
Proof (a eA 4 XEB) and(xEC)
#Poot by stsat94
fcisuingproof 2EANC)
(AUB)nC
XE BA c)
(Anc) UCBnc)
#iuaegy by action: chess board
e CANC)U(B AC)

(2tA 0 e B) and cec


e (AUB) AC
(AUB)AC (A0c) n cBne)-)
U(An8)
From) and (A UB)A e-(Ane)
2 all real no and somex aHe ntegeHh x'=l
ye dl,2.- -3.} (Tuue)
Son.
THue and TLe means THe

D0sjoit: no element s comm on


mCANB)E nAUB)-(A) -nB)

law
Jdenity lau; AAV E A
yE AXB A U A
Dominatign: AV U = U
+ Caueiam Phoduct kelation: AN=
+Fun ction, Idempo teht AUA A
mappng fem xto y Qce to Relation. AA cA

Mamy en ttofits Comp lement: (A)A


CAAB)
Commutoine; AVA NB) = (AVB) A
G eveey tA u-e tB Distr, ASS_Absobl Absorbtion: AV B) AA=A
amd AB Pope et AAB)vA = A
Soyne eB cnd A
Complement LaAUA = AU
Ais bdet o4 B
AA

Crtentes lae
G e det ilde notatçon Poue thot Demonq au's
So1!
2=1 e(AA B) then A d xB
EAAB then
0y 2'= 2 2e A
AVB

c¡nae TS 3
Bi Dive
Çemm Prove again
An 6C AUB
Xe AAB
AVB AAB
men
Membershup Talblei
A= Lab,c ,de9
Bz dfs4
1t0 5 Beumog eof A
A= dL,3,5,2S1,13,1S)
I0101 oIO101010- Aunetiont) hoing demain amd co-demain axe
Be d2,4,68,10,12, 14y

AAB=0 Bitw'se nceasng i4 )s7Ly) heneç leu


aMd stictty
A B (heue,ony)
hecueQsMAg
Bit songfax et A= (23 45 ,6e3579Le 4Cx)>44)
Bit staiagto find wniont iteiectien.
Ause 1to9
Az |||W0000
B= I01010109
compositibn oj funcuion:
AABE tolo0000 :34S 79

element tarzT amdq ae fncton ofat ’ at cesined


:135 Aume
Sol: 2 (32+2)+3
Openator 3(2X+3) +2 6X+9 +2 - 6 t |

Snaph of funcaion
qoor or ceil funcuen
2+

2 2
Function:

LJ= nith n<a<ntI


Showw that set o positie JAatimal nmbus ae
Lal= centalte.
4,'Ve 3,21,212,243, 31, 3e312 epetio m0t i Ret.

[-a]=-LxJ (/)S/)
L24nJ= l]+n
T+n7=f]+n
214 3|s
Parition ot Set:.

1- Set A_and Bhae Lame casdinaltyf thee oru-ore. iDncusion- Excusiom:

2 t thene i ene-tA-ne kumctin. nCA)E n(8) 1A1<18) n(AU B) n(A) + nCB) -n CAN B)

iá s centhaetake a coLurse n
thai is ether finite oy has same candimaley Q.A TOtal t 1a3a t
spaA Prench,
pamish 814, Frenh, 4 iu Russian, 03in
studet Yota!
Rotuera no 3 n Spa. 4Russ iam, l4 taten Prench, &o92
Corlable Spaniuh, Prench Áwam,
has taken atteast one of
#VImp qenTAO n1
R
at|4+b+l03 = 879
2
|4+b+C+3 = ||4
lo3+b+a3+d= 9
o3

Ki7n
-(-)"1AiNA-An
Vmp?aR,aEA and be B Symmetrici Ris a bima elation sn sct amd.
aymm)
Rettexine, aea

tiv: Meet operation Shtexagcien


Cuwpty: a det empt
Fuu Rel: ho onte Linto tol| e K=l

HGTHUat ed t
}RRettexw,
Diaraphi8 R
t l ser- Reytex tve = IUele xiue SetA=2,3,4--100
Q HOw many non-zero entles on
ewes. mo. o reflexie t,2,3)n.
Helatibnlih ( orderedpais A,Buch that
ab
uch that i a#b

Cb=1
22(1) R> counn
4 2,2. (ütoo 500
o 3(2) 26 3,3
n(n+) 4110 4900
O. No. of ymmetrlc relatien 2 2
IAI =da,by 19+48
(u) 0o
1B)= da, b cy b b,a b,b bd

G Represent by Diqraph
d 1),,4),c2 2), (3,3), (4, DY

Co
Rejexine
Pao

(L2)(,3) L4a), (2,) C2,3)(2+), (3U. Cwng machane (mo GA¡m)


(3 42, (4 )(4,2,.(4, 3) S++

1243
end
St 3final C4eneaal Pupo Lenputen luniuwal Tuing machin
then accepteo tal
Mathematcal Tndutien

P(1) Atk( PCk) P(K+))


heny 4 computatibn: PC1) : T e
means tn P(n)=T
DEA DeHAmiaticfinite atoneta P(K)
PLK+ )
inal state: 4 ts baded m Rele Tnstnencesthat tellei P()
M:I
amd tk (PK)’P(k+I) aie THLe,ko cemain o4 tie
C

mPCn) ÀsTue

|+2+22. -. 2n=2 for mon-neg atie cint


So tor 1: 1+2= 2 for o: 2°=2-I

3 t3 TUre

torkAssme to be THLe
DE A: & reneen tuction
NDEA: a.4afy tnite
GiLniamte i< men-emptydd +22
for k+L
2 K+_1

Muet'py wth 2
2+22 2 k+l Ktl +I

detned y 5 tuples ,finite men-enpty Hence, Prohe


M 4
-for 4:

Te
l6
Step BaslG Recusl
2
JS |+ where
=d n2 fn m3
25-2
oo,1=
y*
ei
Recis tmction
ato. value
of tae ey 1)
cus
s iw Re
caphabt Aeesi Recarie
ln formla fornmad well ae andF gecwnse
ei P(K+H)) APCK) P(3)-P)AP(2) A
fraof
def.lne. formulaefor42,3tthen
Bet from openatn Vaiastes
omd oopoitienal
laaphoploe
AaVolues
I£ formed well InductLON Jusng
Poga
-h Ah statent proofs * X|o 9.274 = E

You might also like