ale bs——— Disoute Mathematics. - Masast UNIT- 4 Logic ang Prot preposition (07 Statement - A pneporthen ix a ; dacloratin ante that aime TM OF Bat not Both Example ~ chennat is the Capital ef tamilnadu. <1) T42 = 10(F) ote. © 4 Prponbienal uniinble denoted by Peqiy, S a Te is dmotd by toy p ‘ x Geamechis ae haste Logical eperaton AY, ha ae Gee operator ‘Symbo lx Binoy A Binany v brony 4 | Binary = S Tf ond only TF picondihenal Binoy ae Negaben : (not \1) > Tp be a poepoaition. then She aig op P is preposition not p > ig denoted by TP oY ~P sTOday is monday ap: today ‘% not monday Fy: © scanned with OKEN ScannerTruth Table: a “un Conjachion : (an /A) > HP and g au preposition then conjunchon % P and q ts 2 componint pniposinen p and y > TH te Avnoted “by pag Truth Table Eq! p scotia ai Too git & ald "pag + Te inainin ui and “i ts cold. Stalerant TIM OT wT Dasjunchen » (ov/v) > TF p and q -am te pneposihon, then the p and q & a component prepositiin adisyunchen — & | Pong | > Te is aenoted by PVG (Truth table + : eed | Fy ps adaes 4: 34326 | PYG: 243 =5 (ry | Bra =b Te Satemnt Fe Fo OF alow 7 © scanned with OKEN Scannerse thep Joy Tr anditionat 7 FOP and gam preposition (ay | Stabement | ‘ | FH Aumoid Ky poy uth Coble: stein un ay Col . al ee Z FoF F [7 | F F : T T oe fy siconditional : Crp and only i J es). Statement Pip ond only if q is Stolement. > TH we dendted by Pp asg Truth Tables Ccann cept mane [ P tne | T T | T F F . . : F c e endrig uty Fo 7% P ond g om Atntement , : the component aiatment HF p ten i, called a wondibinal » F) 2p The sun & Shining Today (1) Y +248 =71F) Poq* Te the suns Shining Today then A+B 27 then dhe wmponent called Bitenditienal Eq: Pi S42 =7(7) 4: 643 2400, Pesq: 542-7 it and only 6434 © scanned with OKEN Scanner| alealas _ 4) constuntt the Toulh Table for thé component PY*POSTHOn (P 34) > (714 + ap) Solution * S: (pq) > (44, > -p) Pg py) Peg tq map SHPRH > 9p) la ae el a a jeu [tls F T il T feces etc e T F F T — LF [rit F F T eee tee | ore a T T T LF (TITY E T Ti iy pafer far T 7 T - jeeeaeG ‘cai T tT Convene * 4 HE Pq be the tanditienal prepoxiton then gp t Called abs Convamse. cana Posbiot « * PI Ap called “Hs Conhraposthut Tnvex : £ Po aq & ald Wh nw Removile : % The wnditenal preposition and its — conlya positive corr — Logically 2quivalent. P>ql>1q +p (or) \ Py =-1q> 4p © scanned with OKEN Scanner| — * The nditienal prepomitien and it convene qe = not logacauy Equivalent Pra asp 4 A st 4 atement Fovmula, which & aways Te A Statement foymiula., which t& netthe tantolegy noy conhadiban is_° called contigenty - Logical Equivalent ! Th Te pupositon p and 'qw said te be Mgically —aquivalent iF perqy is a) tautology & denoted & PSR wn pry © scanned with OKEN ScannerEquivalence Rule : 4. Tdentity tow : PAT cas p y PAP cosp 2+ Tdempotent Laur PAP <=> p PVP cas p 3+ Demongan’s Law: (PAG) 23 ap v Aq, Upvg) => =p Aq 4 Negation Louw: Pvp Gos T PAnp asp (5. Double Negahon (4p) Ges p Tag e=sq b Commutatin Laur : PAG <=> Gap pvg > qvp 7 Disbubutive Cow : PV (GAY), 2=S Cpvq),A (PYY) PACG VY) ZS (Pay) vicpay) 8+ Avotiative. Lou: : py (avy) <> (pvq)v ¥ PA (YAY) & (PAQay © scanned with OKEN Scanner4: Absonpbion Law > — ———___ pv (pay) Z=s p PACP VG) ZS p io. Dominaten Law : PAF Gor Pvt cost Mt @adibenal tay : P>y &S apvg on Pq 5-794 +-p a. Biendihenal. low: Pe Ve P24 Aq >P Pesq Ge» ap rq a 9 Show. that, 1¢pv(paq)) and =p Aig aw logically Equivalent by devalopaig a Soult op logical Equivalence Solution : | Given: “T(PV(apAq) = apaAnyq is! \ bow Ap ACA EP) Yq) | Demorgan’s Fae = (pag) = PY 714) m 2 apa (p vq) | out negation tau] = (ap &p) v (apa 1g) © scanned with OKEN Scanner= Fv (pany) Pp Ang) VE a (AP aq) i TPV Mp AQ) = ap nag Are Sogically Equivalent 2) Shows that (PAYA (R+@) and (pvR) SB ane Equivalent Foymula awitheut wring Tyaith Table | Solution ~ | | (P>a)A (Re) = (PVR) Se Lis, ihenal pau (P>8),A UR >.) = (apva), ~ [ = (ap ak) ve=[ Siabinunie tau, | Pvceany etpvay stpy EapvR) V8 = | demorgan’s tow WPAG) = apyay =(PvR)> & -- [ Gnditional taw- PVR = pra | SS eee bp ot Peel a (RS a) and(PvR) so Qu legitally Equivalent 1 © scanned with OKEN Scanner\ (cp Tew ACG») Vap ang) v(apatyy ® a tautology by wth Eguivatente. : PA = : ve af ig ae) = sp) Va Cag vay) ee Pompey : apyag PY sing v ay) Ae) =p aemorgan's law 7 lpaq) =4pyA4 PY 9 (a qary) = Pv(q ay) cp) =P ZPD Av) s@ Distribution Laue Eqn © (aP-41q) VOpay) = s(pvq) v4 (py ¥) Demorgan’s Lau (pag) = mpeg T(CPVq) A (pyy)) b Demoygan's Laur Fom eqn O,@.G [PVa)aiCap'a Giqv ay) v (1pA 34) V cipaay) =" (PVq) 4 (pvq) a cpyy)V -1( (pvq)A(PYY)) = (Pvq) A (pvy) Vt (pyq)a (pvy) are m a [.. PvapeT © scanned with OKEN Scanner| uaing Trulh Tobe . ‘ Solution pvcqav) = (pvq) A(pyy) hse by : laay pviqan)} (Pvq) hele | | . } (Te fst | oT ee | ee ba men te |r ba a for fee ee |e lr : FE ofr ef 7 | Tv pepe yt | fo Cae: FE a | lz et ae Pe ae Pyv(qay) = 9 P+ (q +Y) | TP > (q >Y) 1p > (q, >) (PY) A (PY) ae Logically 4 > CPVY) without wing Tuith table = =p) v (yy) PY(q+y) Pv (aq vr) wl PV CY vq) w (pvr) vy aq v(pyY) \u MW v>(pvy) Y> PVT) one logically Equivalent PV AV wandr-{prahuar (nev) cow legally oe nen [wnatn) midia jaja is @en on equivalent Conditional Low Poa = apvy Deuble Negation Laue 4p) =P conditional taw ev eaqvr commutative law Pyq = QvP Amotiohve Low Pveyyag) = (pyy) vq commutakve Law Pvy =P Poy E-pyq. © scanned with OKEN Scanner| ae L — aes — pninupaly (nyuchioe Normal form and principle aistunction | novmal form (PCNF and PDNF) Fon 2 BLL glatement Fovmuta, Equivalence Formula consistong OF UEnhnchine of mathe terms only Known, os PONE | | PONF PENF = (maxteyms ) ACmay ttrms}'A ~~ -- Acmax tevms') Mote : eb PR and R om the Vouable ther posible | mox feyms ane | | PCNF = ve (P 8YB) 4 (-pvevR)A(py-ta VR) A(PVQY-I—) | ACPVIAVRY ALP Ye VR) A (pa v-IRIACpVI8 9) | pow « | PY Ogun statement formula . Equivalence Fovmula Conmshing Of disjunctive eb min trms i PDNF | PONE’ = (min terms) vomin terms) Vv. .'..! ¥ (min tevma) Note + lek P,@ and R au thw vouabls thin porwible min tevms ane |. one = (PARAR)Y (4praaR)v (PATBAR)V(PAGATR) | V (APATBAR) V (PATA ATR) V (APABATRY(4PATRATR) (Working Rub te ebtaln PONE * Gying equivalence rut cand sumplifyy the given | Stalement formula , Possible apply the fact | CEach—tevm ve | | | * Apply) the Fact (Each term) vF © scanned with OKEN Scanner4) Without * sinte por = a OF * the Fact pap .instrad of F pPAtp =F ¥ Apply distributive Law * Apply wmmatatin” lawn’ Rule fm chtain Powe. : Ung Equivalinte mule simplify ine given statement Apply the fact (each tevm) aT Pat =p Apply = the Fock’ pvirp, instead ep 7 PYAp eT Apply tommutohir low Constructing the Tyatth Table . ebtaun the PONE CAP SR) A Ca eS P) | CPR A (RESP) = (TEPIVR) A (O+4P)A (P38) [ crate! dow , Sivenditenal (our PSQEAPVA | pera = (psayata>P) = (PVR) A (4@VP)A (ap va) Double Negation’ (aw) enditional mart ap) =p , P>Q = apva = (PVR) VE A (1@VvP) VE A(4PvQ)VE = (PVR) V(@A18) A(78 vp) VORATR) A, (pve) ¥(RA7R) © scanned with OKEN Scanner\ = (pvRiV Q)A (PVR V8) A (aavevR)A(1RvPvaR)A (APVRYR) A (apVay aR) Distribubye bow PV(BAR) = (pvayA(pyR) = (PVAVB) A (PYTaVR) A(pV48 RDA (PYTRYAR) A (4PVaVR) A ("pve voR) commutative Lou “pva = BVP Ss: (PvaVR) ACpvrevR) A (pyaey-iA) A | CPVRYR) A (apy vik) | AS: (PVAY TR) A (APV-evR)A Cpv-ta VR) which is PONE 418) © 41 (pvav-tR) A (apyta VR) A (4PY78 VAR) | = 7 (pvavR) V(tpv7g VR) (41pyta VR) = (APATAAR) V (PAG ATA) V (PAAR) Which w& PPNE 2) Obtain PDNF and PCNF , (PAS) v (1paR | Spluhon : | | (PAR) V(4paR) = (ABV (PAR) = (PAR)AT V (1PAR)AT = (pa) A(RVAR) V (APAR)A(BY 78) = (PAGAR) V (PAB ATR) V (PAR AB) ¥ (4pARAG [: pianitutwt haw] © scanned with OKEN ScannerA S = (pr@aR) V(pAR ATR) V(APA GAR) ¥ GaRNTa AE) (QAP) A(AP>(FaarR)) = | Ap V(BAP) A (=04p) V(178A1B)) | ‘ | -. Cenditena) baw Psa 2 PVG | = (1pva) aGpyp) a (pv (aA R)) | <2 Disbilbubve low , Double ation bub va w Acne? = (Apva@)aTt A CpY78)A (PYAR) 2. Disbubutivet Law, Negahen law =-(apva)A (py78) A(pyaR) *. Tdenhity howe © scanned with OKEN ScannerCIP VQ)VE A (PV18) VEA (PVR) VE " PVE) v (RATA ACpYreyv (BAIR) A(PYTRIV(AA7@) " (PVE YR) A (APVAV-AY A Cpy-revAya(pY-1V-1R) A(PVIRVA)ACPV-IpV-4B) 2, Distyibubioe Louw = (pveav , y ¢ 0 Crpvavagy » tpy-evaya (pyre v-1— | A(PVaVvagy OOPVABVAB) A ig S tommutabve baw | ts = ( “PMR VR) A (sp vaa var) A (pvave) © (PVOVR) A'(apvig vA (apv798 v7R) Which ww Powe | TO Find PpNe : (18) = 4((pvavAa)a(apv-te vA) A(PY78 7A) = -1(pvavB) v7 (apv4g VR) V A(py TaV7AR) (AP A7QAATR) V (PA BAAR) V (pagar) u Wihich w PONE = eee | | © scanned with OKEN Scanner4 eur ond PONE of queen _atqhement ereome tach and every Year i Fowl nique ich choose cach and eviry your WH value ig Flat which | Fal calumny value is Tue | Chain PME and PONE CapsRya (aes P? wang | ie s}4 ja}a | ajainin {>t 4 | all ajainjalal ale i esp [EPS RIA (RESP) eye (max tem) PONFLiD term) por T (naan) - . ___ (Pawanay Fe Gpva vk) _ lol le 7 e T F (evra v8) _ F F (pv7avR) T T | Gpatean) eft | em | en PENF= (apvav-aR)A(apvavR) s(pVI8 VR) (peas vR)a (pvavR) | | PONF = (PA&AR) V(PARATR) V(-1PATBAR) @ scanned with OKEN Scannerag te preponOn Find cnr and PDNF og the prep PACASR) wing TT tema POF Cmin tern Bj ek gon |pncen) pen (1max tem | | | ‘ (PAGAR) af i : t | GpvtavR) | os oe | | (PAT AB) [ | (para naR) (pyt@vaR) | cal — (pyteviR) | ae — (pvavAR) | (pvavR) PCNF = (apvtQvR)A(pyteV—IR)A (pyTav-aR)A (PV v-R) A (PYaVR) vinich is PCN PDNF = (PAGAR) VCPATAARD Y (PATBATR) Which w PONE © scanned with OKEN Scanner2 z i | |tersy vo ) | \ ol : | P| & | R | Dw PAR) par) [Canny [OME Kina |FeMF (oon tr) PONE Coin ray Z| Oh TTT OT | | eap T ie tT le oF | T (@naaaR) | [laa 3 > Ty e | T (PAGAAR) z a - Z = T e FE CpvaviR) aa aa a, - z T F Cipvavar) 2 LF T 3 (pnsaRr) a F (Pv-a VR) = | - alae > S | T Grate ar) =. + a & | F (PvavR) PCNF = Cpv@Y1R)A (“pyvAvR?A (PVIBVR) A (PYQVR ): s = ich Ww PCNE a ; | Which = Z g| PONE = (PARAR) V (PAGAR)Y (APABAR DV (pat ank) Which & PDNE @ scanned with OKEN ScannerTieny of angeuinte Ruts of Try erence Rule P A pum may be time in tne devivahon Inhodued ab MY Puke 7 7 d ak A Formula, S may be introduce " . implnd ay pint’ 1H 8 6 dautotogically . ae any Ae on mon «= One powering i Rule cp ctenditonal Rete Proof J Th Scan be avied from 8. and mn Set of puemars , then BS. xan be dutive i Ine Sek of © ums alent Implication Rule : 4.” Modus Perens 7 P,P>a sa 2: Modus Tollens S18, P >a SP 7 ‘Disjunchor cyllegiam P, PVA SQ 4+ Simplification Rule | | Pre = Pra PAR => PQ S+ Addihenal Rule PQ => Pvg : b+ chain” Rube Psa .8>R > POR © scanned with OKEN ScannerP22 = pve P>&= a> 4p 8 Pq Ysq (pw) a i Note 4° rnconsistant ral PAtp SF BAT EF | 7 4) show» that (P58) (RS 8): mA (SN), TEM AN) jand (P>R) => 7p © 0 +8)A(B 8) Rule P | © Pe Simplificati | Rule T [ PAR >a Rs | ® Ruk T [PAG Spa] | ® (asm) n (ssn) Rule | © asm ba Aut T[Paw Pa) B 6 beet Rule TEPAR => P,0°)} PsQipam 6. 00) Rude T [Poe Alor SP >R] Ce ae fule TEP->@,@-5R SP>R] Ore | fale P {133 pon... Ruk T[P>@,A>8 > Por] ; 13@ am >ap fuk TEP >4 = 14 >7P) © scanned with OKEN Scanner7 TP] by 24 1 i pov= frog @ AN =P at > (pry) 3@ ( yan)o Te Rule ee fuy@ (am j yz PAT @ acmany>7P pase TUM @) «a(m ® cman) Rule P dur Ponens rppoa 28) ising © 4P Rule T ; Sap be dniad fom 2) ‘shaw tnot “(R->s) can be ta Fro + ee ae ae R=s Foal tonclurion Soluben Assumed pues Gtiven P> (o> 9), IRVP,8 O- , - Rue Axuned Premios @ P>(es).: Rule P @arveR ove Rube P oO wp Tot aust [eae seve) Pd pov ewe TTS aS a] fe@ woe 0 Rue T [ is Fass @a J uk P ees na 7 [Aa © scanned with OKEN Scanner| —— aa prove that Prams Ot As (psc), d>(bAT0 and (aad) ‘WeEAstent [final anues w Tolse) ‘olution ' @ aad _ Oa . Simplification Rule : Rate 7 | Pe Pe ] : @ d simplificafion Rule soy gy Rue 198g >P,0 J : ® a>lb }& ea fate P WJ bec Modus Pon oO Rule T [ Pee eee) © d>(barc) | J bArC Modis Portas Aaala, 77 [eres Se ] Ob>c)..” _ [fasts Aut | pata => 1(p>9)/ fssj@ (b>Q Atte) ui t [ sinniieton Rate) > PAG Of Rule T | pate =F J J. The Given premis ane Intensialent Y Prove thot tne Premias Psa, a>, S>4R and Pas ame intenaistent Solution O Pas uk P Simplification Rude | @ p Ru T [pra > 7,6 ] @s Rule T [ Simalification Rube Pra D> P,R O Pse Rule P Modua Ponens {uJ® « fu T | ppsa sa © scanned with OKEN Scanner“aftvinoon and © a-er Rule P Hodus Moncns {s}@ R Rul T [P,PSa =>& ® s>7R : Aue P Modis fonens {381@ +8 Aue T [P,psa>e] {9} @ kaar fut (Pe => pra] @F fule? [Rate =F) \ “The btiven Pumms wn inwnsutent Show inet the Hypopuis ,"7k is not sunny Rus coin than Yesterday”, “Wwe aw 90 auwimmins bry if Ho sunny", * ay Aut de not 9 zwimmung: then svt Wil tobe 4 no, = tup and “Ty “aye tote a Canoe bup- At wh be heme by sunset lad to the (endunen “We willbe home by munect Solution Gtiven > Psat & cumy &: Te is Cldvi than yesterday @ > We, wall go swimming Sine wil toe @ Canoe trip Ti We will be home by sunt The Gilven premins are 1PAQ’, RP, WROS ST Conclusion a © scanned with OKEN Scanner| oe er | | : 2 | oO paw ful P | simplification Rube © : walt [ Fae o> Poa ] | Simplification Rule | ®a: i fut [tra had @.ase 7 , Rule P © 1p > 38 Rut [Pea = 10> 7p) 7 Hodus Ponens {25 718 Rui T(P, Poa >) @ A> Rule P T : Modus Ponurs {6® s fit] prow oe @ sort ; Rule P ; Hedin Ponens {ay T tit [Pi roe >a | | Debenmin the Validity 65 the follewig ongument: H 7 is not ws thon y, thea 7 & AOL a pnime umber, 7 isnot Wu thang, Tewfore 1 a pnime numban. Solubén * Given: it Ps af 7 & tow than y | @: 7 & Pum number The Guinn prams at. TPR , 7p { Conduaion , a (Ae qa A : ' O-rp sa. ., Riker | @ 1p ule P @a Ruk 1(p, pra >@) | © scanned with OKEN Scanner\ fie D Usng inaviect method ef prea) denive sap, 624k vale Pumites pes (@ VA), © 70p-s 48) @sGpvas)” Preparers) ® ras 4 © p © © @ pscave) fsoJ@® ave @ Bve © soir {to} © +e ; inaj@ 4 @ Q>7P fa ap @® P fis. (@ PATP @F Rake F (401?) | pas fm th, ond P Avsumed Premise Rule T (pa > 1pye) ute 7 C1(pA@) = IV) Pp Rule T (Paw =7P&) Rule T (Paw => PB) e Rule P Rule (P,P->6 => &) Auk T ( Pye = BVP) a Ruler (PPsa a)! Rule T (7P, PYa >&) Rule P Rule + (8,8 4p =S4p) Rul. P fue T (par =F) © scanned with OKEN Scanner“g) UA ndinecl mttned, show that R>4@, Rvé,€S78,— 9 . poo > Dp | © 7hP) Ansan” pred @ Pp Rul T (IGP) =P) | @ Poa fue P [223 8 Rul T (P,P > 8) © R>748 Rule P © s>1e8 Rule P {5.6} @ (Avs) 719 fale 7(PS8.7>8 S04) 9) | @ Rvs fue p {13}]@ 7¢ Rule T (P.P-3@ >a) {nO F Rule (@ Ate =F). _ TAUTOLOGICAL IMPLICATION : | A Statement Formule A is stud fe pe tautolegically imply a statement formula a if and [erly if ASB & O tentorogy ee © scanned with OKEN Scanner| | | | ay py > & C3? provi the tinplcanon P>cg7 a) : P>@29) > (p>q) > (pon) & a Taulology ' P>q>n > (p2qy ep >) BPH knngy-> (p>) | | Pog . = Prag sn) le F qn T F @ scanned with OKEN Scanner! as fe Prove that (Poq)a (qo) => (poe) (P29)A (4 > 91) > (pon) sa Taubology (P2WMA (4-1) > (pox) (P>q) A (q >A) pow 4H Pog T 7 [oe [=F 7 = T 7 n” T F + | ee] T F Fy F Proved. “Mente @ scanned with OKEN Scanner| Pnedicatans And Quantiptes * pot i bo tay \ lus (tne predicates cau quemenls % —pedicatens then MMe follow" ‘rom is a boy” * The above sialemen! and the name Ram ws -uipjact: at ts Atnoled by BL) my ® 2 predicairs PREDICATER Note 1: 7 ital Letns Always wr denne pradicabs PY oO aod ah suber by small 1 the type om gual any stabment et by “sig p’ when pis a predicole ond helene can be dAmoted by PLA? Quantifions * > quantigior & pre which & uned te quantity the pate =o Vutnles . . > Tow on 2 cinpontont quantifiers svtiich ar fon “au” and for "Sum" Whe = Sum = mtons alteart One | univewal euantigions : | > The munntifior for Nal’ x! 5 called | aunivensal quantify ” » | 3 t we dowoled by the “symbol (Wx -on1 (x)) (The Universal quantifier sequal te zach 8 te Fol panes | Fon a x | For toch x Eveytung X such that * * * Fon eveny x * * Ean tung < such that . © scanned with OKEN Scanneroe rs Evo Apple w ned TH above Abatement can be stated as | Fon al x. TF & on appl then x bb med Dagine ACS © & a Apne | ROO? 2 & ed Tet denoted by the ayia PE Wx (A(X) -> Riz) Remon “ The Unuweual quantifor is alao\ danoted + by “(wx on @)' Existential guontifien 1 > Tth quantifien $1 some x bs uae the _exastenta | quantifier. . > Te & denoted by the aymbol “ax . | > Tm coustentiol quantifii & also equivalent © each eB the following phrapes | For’ some | some 2% Atlch' that * * % tho. gusts an x, such that | ® Thee ban x auth that * | Troe anit one x ach at Example a | | | | Some gins sone devant | # Dagine + | Gans x is a gu. | cis a i deven © scanned with OKEN Scannerbs clever su and % For some x. 2 & a gu Fx (6. ACH) ge tee © Rul oF predicate pnd counters \* Univovat — Gignralsatien | PCC) > vx ipcx) | * Exstentlal Gunvvalisaben PLO => Ax pcx) * Univenwal spedgicahen Va pz) = pce) | Bdistential —spedgicakién 7 Jxpm > peo 4) Skate that (Var) (pix) > atx) , (Sy) PLY) = x ac) Solution: Given: | W(X) (pix) > a(x)), (Sy) Ply) => Ja aca) a) (VM) (ptr) > aca) Rule p | 2) po sew Rule P vs vxp(x) = plc) 3) dy pu) Rule P ) u) PC) Pule Es (3x p(x) = Pec) | 5) atc) Rule T (Hodus penens) | b) Ex ax) Rul EG (3x. plx)) = © scanned with OKEN Scanner| “9 Prova that Var (pix) > atx), Wx (R(x) > 78 (x) => va (Ax > pen) | | Guan: 4) va (pia) > a) , Rule P 2) Plc) > ale) Rule us 3) TR (c) > plc) Rule T (ignditenal rude) UW) Wx (RIL) > 7 @ (2) 1 fre ‘ 5) Reh, 27800, , soos ftps i ‘ b) RCC) 4pec) Rule (hen rule) W Ya (R(t) > p(x) Rule UG | 3) State that (3x) (Pex) A atx) => (Ax) p(x) A (AX) R(X) the Convene True? 1. Ax Pix) A A(x) Rule P 2+ Plc) A BCC) Rul 7 (Es) 3» PLC) tant AukT7 2, Sumyugicatien - & ew : ” nar | Rule {3}6- Jxorx) : Rule For {yj o Facet) eee | fou} Je PXIATL A). ude + (simplification Rult) | “TM Wnvewe 6. also: tune | Ax Pla), Az), Auk p | Zs. FLPMA yaa 1 Rule T | Sumpligication | 3 Jz ax) 7 Rule 7 Bu fopue Pec Rule Es © scanned with OKEN Scannerfa}5. ac 1 x (pte) nate) Tm pre & ako THe ye te | b Plc) ALC) | | | Shot. that the premus “one aoe ave! and | wale programs th TAYA | eee te unite sien conclirniog con gee hugh pay a in high Raying so" can | “someone tn mms Cd Soluhén | let ctx) 2 x in ths dos | gen) Knows. JAVA. progyanes a tox can get high payerg Tob The quien premise Ju (cl aTea)) , Vx (TO) > nO), | condusin dx (C(x) AH(a) | 4. dx (ca tex) Rule Pp 2. C(c) A Toe) Ault ES ) 8 c(e Rule T) | 4 TO a | Sumpligi cation 5 Be vx (TH), > Hex) Rule p + TO Hl x ‘ ; Rule us . : {uth HO Rule T (modus Ponens ) ( Rule T (simplification rule) 9x (cOx)antz)) ,, Rule Eur fat}@. ClO)A HCC) 2 © scanned with OKEN Scanner5) Miuigy s Every living thing i plant on an animal _hn's god gish by abit) and ily mot a plant... Alb animal hove Fears. Therefore Tolu's gotdgsh hos a heart SDAulion * te LOO saving hung | PO > Tw a plant | ACY + © wa animal HOO % hos a peant LG) + Tohn's—goldgish is alwe Pu) + guldguh & a plant | HG) + Tohn's goldgh has a heart, | : . Th Aw pms wie 2 3 a 5 {sib} ITeele- wa}to- Va (102) > pix) vAe), [LG) A pL], Vx (At > Hix) Wnduaen HC) © wa (Lee) > (pla Vax) “LO (Pei) vA) LU) AapU) S{UGpuek) — q adult pti) : pa) vad JAY). Q> Wx (A(t) > Hex) ae AG) HG) 4) Rule p Rule vs ful P ful TP LY Sunpligication Rule T Aue : Pale T (modus, ponens) Funke T (disjunctive syllogism) Rule P Rule us Rule T (modus ponens) © scanned with OKEN Scanner. parce woes 1° State tat statements ae All" tomedians ane punny’ and Comedians who ane not purry Stlutien bee Ce Zs a comedian Fioixzs Funny THE guvenpnemins owe Tver (CC) > F¢x))) TW% P(x) = Sa apt) | TCS ptx)) yx 7plt) qx Wx (plr).vqlx) => indinect method 4) T( vx ((p(x) V 3x gtx) 0 (ave pea) A P92 19x) | 3 Fx 7p) A Var 4qtx) yy Ix aplx) . 5) | Kyo sy a | yx Qh | “Tplc) ‘ago pte) A 714.tc) vqp i moby tue thy “tpn ae 48M ga (cx) ATE) (C(x) > Ft2)) 3x 7 (106) VFO) Ju (cery ne (2)) yo plz) v Jz g(2) aimng Rule p_ (Mausicd! prem) Rule T (Dt- Morgan's Law) Rule T (Nagahion. Equivalence) Rule ( simpligication Ral Rul. Es Aule Us Rul T (Po => PAK) = © scanned with OKEN Scanner| @ Ape veo) © fle T (Damongan’s Laur) toe Vx (per) v(x) _ We PCC) ¥ yc) ee a Ihe pla Val AmUpCe) VGC) — Ruut T (P,@ => PAR) % Vx (plX)>aCe)) and TyCP(y) condusten Jz e(z) Using — anduuect method 4.7(42 ez) Maumed Premuns 2-742 7a (2) Rul T (negation taw) | 3+ Vz 7a(z) Rul 7 " 4 1@ Ce) Rul. Us (3) WH (Per) > @ cx) Rule P fuble- Pec) > wc) Rule us 1 pte) Rule T (modus Tolbens) @ Jy pry) Rule P 4 Peed Rul Es frajio» Peo) Asp (cy Rule T © scanned with OKEN Scannerq ee er ers y ei ising 2 _ Prog Prove that ya is dvrvauienal bY 4 a Asuig — contmadiction Salution Y2 % nahenal Ya = Po, Pg Ee, y#er q Pand q have no twmmon diviso% (2) = ppy> (3) 2 = pr ' a Ps ag > @ Since PY os even integer , P even) wibegey Prom 5 @ Sub ey ® in ry @ . (am) = a9> 4ym™ = 94 Sine g> is an, even integer, q & Even integer L. PYG Ou aan Hente Py a hor, wmmon focyn 2 ~ Whith ib => & Cieninadiction ) te owr = amumphen “, fe ts Dwokenal. © scanned with OKEN Scanner