. a 7 ruth tab Les : >On aw wo ' E uth 4 b . ou : bles fo y th e fol LO WO in J: ath Pp AStatements: {-Ttme Statement is an Capt emion which ii, CTthey | PE anise ond, not. both. .. Addnd iS sprous HOOR Jdbtess Hor the idbhouing ; & Cpvep) VP a0 : Te ]aep PveP (ever) VP , eT; F aly a i ear afi a (evep)vp is & tuatology 2 TRUE (Pveprvp' Fs sav contradt ction + FALSE a tb (pvp ap 1” al Conclusion: (PYePIAP iS a tualdiogy FALSE (eveR) AP as. 4 tasttediclior : FALse Gb (pvepdv(ep) io. (ee Uvep)v (wp + +. “a a twP)p lp | pave | lprwed¥P ieee | fF % ale | F ‘a MY CpreprrP moog > i p [xP 0 Awp Cpaep) ap| ‘ 1 oe | FE ¥ F ( contradiction) eat F a tao Hu ct vit) Cpanp) vtop) , * vere & op _| (parr) (pawpy ¥ Cap) | 9% - (qo 8a ae iF F 10) Soa ot | el i F T “tho Cpnep) 0 Lp) Mp lap | treme) | CPsORRR ca | ip F rs yy Fe ea ftontradictton) a | tT e EF . a y |-yTP one tautology statement ig Combining with iwc tautology. by using oR gate: ~ H sne contyadiction statement colt dthey statement, TE ig an Contra {3 combiningmula" Coonectives ¢ = AnD | pre uth table for following » pdDYowW wb (paepy—PP Ppa (PY CQnn))e—> CP > a) eel >Q | prGareoe-& | >) Seti” p r at, é 0 = + c | | T r | : Ee | ie £ | T eo eee ew e K F v F F fe : ie cal = ! Ww Ep-rgd ACOs?) > (i BRIED AG pre ten Aa om res ie wpe Pp Qik Poe bv (@>aya(@rn) YOR [praa(are) 208) ia) | Th lcd i = 2b ial cali T 2 di eae r 2 | 1 eee F a aF eg yt 4 F ali 1 i £ fF Fiee| $F ar + - Peet = ~ent: statement fg an expressions CObtop statem “sgoy). false, sbUt, MOF both Contoins * either” tue Puoposition: TE is o stogle loed Statement _ which io efthoc tue cov) false but Not both, poimise + HIS o single statement ilself. ; Wet! - formed foymula: It ts & group of Connecktyes fn oO statement ( any one) 1) Drow ctruth tables fox following: ¥ (pa oRd)AR) (mp), ee BY PE AE od ROO of ($heute) a) ral alae [oe Oe r 7al | etthey yue | sreprerent the logical } @ompounck Proposition: Ay A contradictions m ve byt tente thot’ ts Stotement fh Eke ment tg a Wi tov) -folse bat not both. fg: pawp is & tautology > false Gan be ¢ ithey Paopositi ov. : A proposition TS % slotement that que (0 false > i must be one tor) the other and iL cannot be bobh - (Group of declava tive ste tell oamed formulas: ; Bias a Sym et ute , expre of the ; foyrou(@: ” 4 jpropositvonak togre bolfe * porque ge to ysfon thot obeys the Syotatic ould propost Hom oF logic iS calied well formed Inap_ points = ‘ es ie axe tava ond Yolsiftable bub y. nee avtce gis: i vee faist#ovte bee, a All “tpatingen's ave vice -VOsa- ; BA a Xr ‘d and Seaaunarnbte “na A 5 a toutologies aye vole5 52 95 (dood 2. of ond p. 6* > spend yee 19 OF? 5215 0nd ure is (9 F pvQs 6’ > O60) ond ude et)" t a at ent) ond ut 2th ar) steam ond W716 is. 7 pve yt ei6 OF) ps 6725 and pvQ 62218 ond yici6 Is F bps pie inland us 6 (1) ] eva 475th and Yete fs Ww A pind 18) Interpreted 99,119 conditrono! ‘statement uch that p is hypothes(s ond @ ta conclu elon Ate conditional Slotement pra defined be} 5 teads a w “taye’ wniess a tue hypothest —conelusfon: “or +. yqtn ( Hypothests Dpra: 4 y= 4b) and g2=30 Wis - pra: vt 4olMand 6" .30 iS a p-zqi F240 and ge geWis T, ae: qesug tn Hyphothes!s ap 62280 UF) Conctusion ‘ | ps 740 ch) nypotresis . fac Son wD) nqpncwilot., > 1; 2a peeve uo C7 napenet) Rr 6: 36 3H) Gpenviors > Pag tot us, Thtevpretations of tonattconall * statements + " a, = eS — Fedgde > aé “tae Conditional Statement & P Converse Stabement * Q-—-P toverse statement a e TO) + op Onlapesttive statement Z~y Pov a condiHonal statement “PQ the tol holds goods ) fay (a) conditional stotement P>@ and ConMapositive : VQ and xp ave equivalent to .¢ach othen. | (HQ ~P) } 4 D Converse QSP and inverse psy wQ ate of ©‘ equivalent to each othey. Pi Statement: if SX-1=9 then aA=2Q Pestle) Ps 5a 1 =.9 | Se = 2 ie P-> Os iP 5X1=9 then Aer QP tif x=2 then BL =q wp -7rQ2 if 52-1 4q then 24Q MQaopi if ata then Hx-1 4q. PHA Statement: Stakemenbs Hat matt and onty if X=5- Mol Pt At => 1011 0} vestony TR REST RE Fi Rre + t if and faked s TE and” city Heat ® tl, ts a triangle: statement pew polygon r as 3 Sides: gatement Qt & poly goo exoctty / Per Q | F F ar #f o polygon is a triangle Hf and only ff o hos 3 sidegaght) pelygon exactly if.and only oun Hero. polygon is a tiongle have 3 sides. CF) | polygon exactly not d only if & is not a tangle if .an incSynd SLOSS) +p and only if & if polygon pposgee exactly Jif polygon iS not a triangle ptygon exactly not hos 3 Sides: CT)- Copva) “2? 042 Q) i ee pla ip ~pvQ pevQ @Pva)e» ay ¢ ae ae cs a Re * Tie E Ss Rom tos : aa ; etre | Fasoks Foo FF, : FF il =k : os "i f (va) = Pre - List of Gquivalences : * (Kp > py ~ et4 Els oo —0) ea: (pra)<=9'(@np) j @3: (pv@) 4=> CQnp) | 64: pa (anak) <> (pra)ar ES: py CavR) 4=> (pya)ve ¢ &6 pA(QAR) a) (PAG) VEprR’) | Bh: Pv Lang) <=> (pve) 4 (pve) Eg: ~(pAQ) <=> LPVYR Beem ®) <=> PWR Cnt PYPS=|>P Ey? oh unloved 4 Commutative lato t Assoctahve [ow (ae butive lou’ 4 Demorgan's lou G3 pap => PvP Bos RV(PALPISR at RACPYSPIE> KR. ey: pYop >T| prop <=> E ‘ a x a p-7 & <=) 9p : w(P-7 2) = prar® oe ‘' Imp oie p> (ak) <=> (pAQVOR ie “ ag? P * fq: ? qt AP Hay: PO (p> @d4 COP) 0? Bey: (PVE) <=? ( pag) xp #2) 9 Saas aul is ist of Impticattons: , t =— : ea EPABIP? Poison, Riley b oA i. ¢ “a 43: pva a ; 2 ef + pva = Pop? Po a= pre 2 e(paw P 20 es? = 08 Pie. = 2 00% Qs)prterence Theory: ue aeale ; can be inlyoducecdt at ony : Rule p: A premise * on in the devivation: Es ~ Sor point of Hme swproduced fn & — Rule T: 8 Benoic. 6 can. be ig toutologicalty implied by ony deviation hes cformnulos fre one oY Mone of the precedding ihe devfvation- — Rule Cp: ¢ conditional proof) se om R and gob of promises Ft we can devive R>s fom the set of then we can devive — premiges alone: | Pur Snow that R ts a vattd conclusion from the premises po & AOR, PO: _ Solr Given premises: + Conclusion ¢ poG, QR P R ia w P7e Rule P Rute P ute £0. (22, 4° pf aa w P Bw & iy Rule Pp Rute T, (3) (4) Pao 22, QoRay Show that Ra (pvg) is a Valid fonclusron — : hon the premises pv, QR, PSM, YM. Bir Given premises: + Conctusf or ¢ LS 'PVQ, BOR PM) .9M, ms : Racpv2). om v5ecy uy WPM wpalepe La Ww oM Rule P Rule t, ay, ney) G) oP p> Q = ~ Toivd) wn, PM => op guy | ty) pv Rule P Cyayy| w 2 Role > €37, 64) 10,5 wp, pva ->& LOY (6) Qk Rule P faye C) & gute 7, (5,68) tofu) - Wd Ons . = > — re oe eo P9904 19 b> vile {Qs ee ; ae * ~ Visto wont od pow a) RaLovd) ,wle Pp ppsq'' a “a tye figs P2US? 9428 ary roger: yule p fom. Fg 4 Fa e te P bday fo vq » . 39 =Sup 02 Ley op le t WW) 2 Tryin) P a on ‘ sasial Whether Ris & ait Cares “ o> QR, PYRE for the doliwing premises Pra? & f- | Sot Ay | w pvR rule p wy | wp ile t Teh ae f PVR =P a (34 | wPra wie Pp dash | wa wule T 00), (2) yt Pr P?@e U5y | CHIQIR vule Pp WU35y| OR rule t Cy, (5) Thi PPA =r Q ras | Tt thore was a tennis game, then ovelling | Wad drficutt if they ansitved on Hme. then { haveliing wos not difficult. They aaived on Hme. therefore, thurs war no tennis game: Sho Statements Contbute a Uoltd Con 2 4 Inteypreted a ‘bolowing‘ter the above statements, ieee 7 interpreted 04 follows: ‘ POO Cif there wos a tennis games iavetng wos dtfficult) - f yma Cit: they, aaived on Hime, not difficult) - travettng was R C they ayived on nem ~p ( therefore, there wos no tennts me. : game)- a ay R-» 08 qulee fay | (2) R sule P . : guzy | ¢3) 98 yule T 1), C2) . Int fo pranre RS RQ =>oQ@ uy mw eRse wule P rule t (3), OY) Vay ES) “Pe ; tee emo. ~~ "Pa following ne. an “be’) ae trem ot R po 9978), eiurs aRey LUCY A” uy uy Yay 284 JB C64 } L364 4 (8) & Banc Ws i S264 " C8) R-S u) pv DvP? Q B® Qs WM sp->S W v~8->P (8) P>R (+) WSR (8) SVR et (57> p, Pk => ~8—> RD Yule p yule T, €5,(6), Zn? Ps pr@ ~q QdQAS arg rule cp show that SuR 13 tautologfcally implfed by the -. Plowing premises: pv. PR, Q>5- rule Pp wule tT, G16! P~2A<=> MPVA wp > Q <=> pva vule p yale tT. (2), (3), 3: p2Q,Q>R=) Pk ~P2Q, QS => “Ps wule T Cy)» C18: Pre yrQr>P Cas» p <=s wp-s) kale Pp sule T (9), C6) tig: p27 @ GAR”? pk i? | Fle T5 Cig: p>Qd=> oPv@ a | (859->R cas SVR). “2= all? FR pea “yf 4 ; : ‘4 om d floral forms: odizeed Boi I ce >» Confunctive Normal forms CONE) rtm forms j —— 5 Disjunctive Novmal forms Cone) ey clauses > Congunetive clouse > Disj unchive couse A pr Q! PAs Paw@s ~prag> Qnjunckve clause: oprr® clause: V prQi Pv, pyrQ, apva, Disjunctive apvrg- } cnr: Cpva?“ (pvea) a” (~pv@) | pnt: (pA) VCpnwa) v (pra) 4 . af form, for tre ' ft, 1) Obtain tre confunckive norm oe folowing propositions” C98 BWEAQ) San & w(tmp—sn@9) AR) A Sd Given : ~ (CMP? wQ)A (aR) oe o(cpvaar sR) eee + (6h \w = (wPNQIVR Capyr) CQvR)( obtain Oonjunctive novmal ddoym from the. : following proposition : (p 2 Q@) > (~RAQ) : f | Saly Giver: CP» @) > (~RAQ) X ' p->Q = vPVa = o(p>a) vy loRag) x vlwpva) Vik Q) ae a Pe (pana) Vow RAQ) — distrfbutive tos (pveoR) A Leva) n Log ver) AC YQVQ) a PYOR) ACPVA) A (waver) AT $ Somme mg 7 i fi i iW = cpror) alpva)atwaver) [vsaT=s] aa\wl! )) Obtain disjunctive normal, form the folwewing Proposibion : (pA wtQard) vt p> @3 y Soh Given: (Paw (@ar)) vip +@)., = (CpAwlOARy) v Copy) (p->& = PVA) = (patwavee) v Cvpva) Cdemorgan's lew) EZ (PAVO) v Cpr) v Cvpv a) 1 (a1 P¥@ = Cpra)v (wp Aa) | = (Pam@ V (pane) v Cupna) v (pawQ)Paimeiple Disjunctive Normal a which equivalent to th PONF: tne “brmul ms only doll. consisting of dime of min ey we cated PONE’. i be Tf pppae te too VoriObles ferms ave = pAQ, pawQs wprg> fp min terms cov) ¢ then the am pare | > pont is also catted Sum Oo Sum of products forms: ON F p ONE (paad ¥ tpAwa.? cpa) v CoP) (pave) Vv (wPA Q) (pave) v (xP) Sea = oP. QVeq =T apvT = T gn oQ =F opar = F a pve =P atin Qonstdey the dnt? (pada v cP) © fp above ONT, the ctoss vp S no make it in pONE, wp con be intevpyer t tn,> PONE for a propesitton:’’ can. be: Obbined | with using truth kabtes : twd methods (y dt without wing truth tables. Paoced ure to obtain pon of a _ proposition | rutin toblea: Midewty sot a 4) eect tuth tobles for & proposition. 2) Tdenttty the Yous. ‘tn the above tyuth table os tue: | rat hos the tuth volue minterms fn the above truth 3) Conitruct the as TRUE- bated table that hos the twin value | on the tollowing eonal(tors ¢ ae Tue vaviavle Con be Conidevet o4 ft i. by a falle Varfable is Suppose to be considore & os ib Negation. u) Create the Cum of minterms obtafned tn step-3 _ that yeutts fe pONE- i 1) oblofn pone for me psoposition: p>@pan @) 1) (pa@) v (vpn @) ¥ Pracedate Pen ® a formula which is equivalent to formule fondteting of product of Max teyms cated Cd pen F canonical PY" > pen called 04 product of SUN Procedure to obtain pene vsteg shuth fabler: Fae 1) Constiuet truth tables Yor a proposition - 2) Identity tne vows fr gbove tivth ‘table that ho the foite value o8 FALSE. 3) Construct the moxterms wn above Huth toble | that. hod truth value ov raise bosed on tne qollowing aivvshiedone ae roy _ ial ; a)a tue varlabte is Baad ta be tweoted “as is negation. . ’ pa false yarfabte con be treated os Teinky - ts product of montoums that 4) Weate the Peta in... Step -? ir? PONE: > mortermy: pv, Pv, pveQ, “PVA O- and vyeoulls fiom Roe fee”! 1) Obtain the PeNF foy the rein ae R fy 9) pee | bs | t | FE EF | — aoe (P eee s f ste | Te aft { ie [tte FJ d | ii 7 FE T é Dal Pele p> Covvesponding ry r a + max teym , ec m=) | aide ajoxt ! Pete thet elu? W Odblam PONF and penF fy the proposition * ! (pra) vtopard otthout using truth tables: Bly PONF? om: (prg)v tapar) a = (pagar) v CMPARAT) 4E CPagatevon)) Y(wPARA (Ov) pcr RSfor ponF: considering the remaining min tevms- gemain'ng ) = ay = cpan@ar)v CPAranak) vCsene’ wk) V Copan Q Ave) min tery pen = a (or) = (wpv Quer) 4 (wpvQva) A ( pawQvR) “cmon tev) at pyave) & find penF ond pont oy he propost HOw * (pvR) 4 Cpvv a): u: (pyre (PYe@) yoOVvE) a (pveay (Anok)) yal prravR) A cpyveaver’) mon. teyms: abe peMes RET pvRVF) a CP no CpvRv Cane® Le (pvRvQ) A (PVYOVR corsidering the yemaining iy pont: gxemain ma a he ons erfavsda Cen e r RDA (wpvoQva R) PINT = w(ox) = (wore ohne (parQar) (rane terms) ‘ eee eats ht’ , f part of the declarative sentence descyloing t called as predicate. | the prOpevties of an objec Ane logic based UP se Caned Precio Te Logie. on analyst of the preciicat es| Be Consdey the kwo statements: Stoterment-1% Jbhn ts an engineer (ww Statement-2: smith (s an engineer In the above statements both the Obj eat John ond smith have the same qQy Propey, ty ts . . u & “being an engineey' . 3 ( A predicate tg (ually denoted with the Coptbat tebteys - : 4 ; Re poo: Lie an engtneey les Cts a piedtcate) of Vorfables are enclosed tn Poyantheg Re phys KAR Toh smite y px) = is an engineer i Ond the tist % td Tohn, Smith Y Quan tefrevs : vie > ~ for aul Quantifierg { , ee =? a - CxS — tentiat F-for ain ig used tp Yepyesent the whole «loss. WaNeigosotay, atc. .” rAd». 5 tentfat {S$ ured t Yemerent the only 7ww @upres$ the “folto wing Statements fo Sy Foe Something is good: ¢_ [ar tel Gtx) be the predicate foy the property: _ | Good then the symboite form of Something IS good CON he written as @B LOCK) on db Everything is good: Soh tet GLX be the predicate for tne property Gwod then the Symboite form of “everything ig " : god” can “be written as AFA Gln). eA dt Nothing (8 Mood: Sop-teE Gtx) be the predfoate tr the Property | Geood then the syrabotte form! : of ‘nothing t's good” can be written a At Kler). & Something (8 not good - soh- tet Gui) be the predicate dey the property ndt good ‘then the Sympottc toym of “ Something ts nob good can be writteo ab 3xXHlo%). a ust ee W Express the ‘following statements YtIng Quon fiers - wo All students ave Good: oF RAL py j “(Any inbegey fg eftney posftive (ox) negative: Sor The predicates trom tne above statemenk con be interpreted oA 4oluows » d sty + x is a student GH) 4 book 4 2tx)? Ay Integ FO): efter positive CO negative.y All Studenks axe, Gwod con be Written oy: 4 fy al, ff x t8 a student then, x fs good | Now, the symbolic nepreenta ton ar ltowy, 8th) Gtx) fd Any Integer can be negative Cov Positive tay be written a: oy ally, tf 2G an Inbeger ther % Con be ety Posittve cor) Neqativ Ox Symbolic stepresenta ton igs Ten) FX) Rules ot tnfestence t => = Revisting the Socrates, Crxamples; We have two’ premises j Y | =a men one moatat” >‘soerotes is a man” ¢ And the conclurion t fi \ Es“socvates is, mogto © we get the conelusteiRone proms os? e tow di The Mguments eTilensc Tr be can express the in paedicate logit a (monla) > mortar wy) Ba trical mortar (Soe ee premises and the conclusion | Mion “ciqumenuie* pw @Barguenens pacpostttomae togic : _— = =— = ig a Sequence of groposttiorys Ol) bub the Hnal proposi for are colleck Premises: The lat stotement fs 1 ts voltd if the Premises imply 5 On ovqument n “yA aigument in propositonot Logie Ine conclafon | -? The argument wy the Condusvon OM argument tov ¢ thot TS Valld No mottou whot propos Substitutect into its propositional vont ables: Pr ancl the conclufon {Hons axe of -yHf the premises axe Pu Pars ts q then: 12 tDK (PAPA APD) > 4 isa tautology. “Gules of inference toy propositional. logic: Mode ee p24, Corraponiaing Taubology : p (pAlpq)) > 9: oh q ‘ fy tet p be “HEIs snowing» | tet g be “T wlll Study discrete moth’ | “ee a fs snowing , then + will Study discrete troths! eethats Snowing". Baya! study dtsevete mot, then we will yo Skting" ts tue then by enodud, “therefore, I will s “tf TL Snows today i - Hypotheris- “if Snows todo ponens, “ we wilt 9 Skting" : : mais tie:ri Hodus Tollenss P>q Corresponding toutology : 7 es (wpa cprgi—> »P i sae , | é TH] Aga tetep be” iE fs Snowing” tet g be “FT will Study discrete math” “ik 18 snowing then T will Study discete maf j *Z will not Study disevete math”. | “Therefore , it is not Snowing”. | Hypothetical Syllogism s | Red Con eponding tautology z Bey? 2 Fipa) * | eee * (e344 sno Cp) {] fy: tek p be “it Snows" tet qd be “Tt wilt study -digevete math". tet ¥ be “T will get on A” “if Tt Snows. then T will study discrete math vif I Study discrete math, T will get 00 *Thervepae / Tf iE Snows, T will get o9 a" Migjunctive Sy llo isms aaa 7. onding tautology: - pg9 be “ TF wil Stady english ilaature” { Study tet will Study discrete math oom r wil Aatish Uilmatuxe”. + Study discrete math". “T will aot “therefore, I will Study english Literature”. Addition: P conesponding tou tology : es 2. PVF P— Cpvg) & fet p be “I will Study descxete. ath", let gq be “T will visit fas Vegas" disnete math". study discrete moth oF = XZ will Study “herefoxe » FE will will visit Los Vegas.’ Siuplificativn® = pag Corresponding toute logy: ile aq (pag) 22 study aeserete math” & tet pbe “Tt will > lek g¢ be “LT will study engttsh titer ature: VT will study discrete - Oth and engl(sh. tilenature't : ; Stherefoace , Twill, study discrete, rath." son ile we Gnjunction: sae Coneponding ‘loutology : sion = (ng) > C o pag, ng) Paq)1 ater S feaplutions | > wemeapondingy toutalagy pve (ber ace) qu " e math. } fy tet p be Ug will Study discret let y be “T vill Study english Study dotaboser” os th oy Tt wf lf Study ietovatwre” y . te gq be *T vill } | %7 will pot Study discrete Ma english tenature” “T will study aistete math or T will Study dota | bases". = |] “theredoxe, E will study dotobares ov F will Study | engitsh toate tT (nve) Ry If todoy is tuesday, I have a test fo | Swe mathematics oct. ctonomics- Tf my Ctonomies Es Potessoou ty Sick, I will not have atest - Sa fn ewnomics . today iS tuadoy ond my onomics pooferroru is sick - Tae mre D924 Fhave a tet th Mee hati. - a denote “Tod * ay is Tuesday" SE havea tat in mathematics”foch Slatement TS ettheon a Premise 0m follows fom previous Sstatemen’ by vulea of inference | be lost statement #8 cated conclusion « fA valich argument takes “foltowing cboms | St | Sa tutu sa Sn ac Voltd gunmen . fxn) > alin thee hypotheses : wgt is nob Sunny’ thts afternoon and fis Colderu tyon yeturdoy". “We will go° Swimming, Only fans Seno “If we do not go swimaraing + then we wtlt boke Gnoe trip’ ‘ Xt we take a Canoe stip) then we witt bebome by Sonsed' the fofaence wlth construct o valid on gement > laing “we will be don the concbaion + dou on: =— => choose proposttionat nome by Sunset" ps'd 1s sunny this |2 Tonlation into propositional do gie: ypotberes = pag. FP) AY>8,.S—>t anelusion ? £ t valid arguement: —>Conshuc step Reaso -o pay Paemise ; F Sivptitica Hon ving a) a) op 3) IP premfs¢ ou modus toler using ta) aka Qt Sars Plemise we modus ponens Using ty) and A) y Sot plemise 3) 4. modus ponent vsing (6) and a. Faa: hom tne single proposttion. ne Show that gis a conclusion. Qp- step iy poemis & a palp9) Conjunction using a)IS e @ PuemiIS& om -followss fon. previous Slobomen ts ty tled Of Inference which incwdes Ruled of fof - toforence fy prepositional Logie: Rules t wlth of Inftrence doy Quantitteel Statements - epthe ruler a ythe ot trlerenre joy. SURE EEL Stat omertt ore fohoduredl th the next SevemmUn hee: y) universal instantation (yr): “Pe pin) pled & Our domain consist ot all dogs and Fido 1S a dog “All dogs axe Cuddly’ “Theredone, Fido [3 Cuddly". DNUniversat Generalization C(UG)+ — = pce) doy an arbitan fA HP OW) ¢ i | sued often tmovicrtiy tn mathematteck proofs 3) Puistentiak instantiation: ee Jupoo sania a » ptt) foy. Some clemeaa er tn the y “There fS Someone who 90 cours e'- * tet's, Catt hey a and Soy “that & got on Aly) Gristentios Geenenaltzation (° ti); pte) for Some element ¢C ——. i ep tae) My" wicnelte got on A fn the clos" “Thevefoae » Someone gok on A fy the Closyr fallacter; . Some follacies , O Hise fn fncorvect org Uemeny ; aesemble ules of {rference bul’ ‘ave bayey a Contigencies other thon toutologres Qu TH you do every problem In thla book then, you wil leon dtsayete Mathematics « Yoy I dMiaete mathematics There foxe, you ded Every Problem fn thts book, Ts thre Mgument vaitq? hl 7 Bh ick p be the Proposition * You did every 4 Problem tn this book", tof gq be the Proposition u You oined aiseyete mothematics”. Then thig Mgument is of the -fam; Be ond 9, sthen és » Wing Rules of inference; | = ae i — / But Using the rules of tnfeyence , construct o voli Argument to Show that © John smith hay tv tog" te Q Consequence of the premises + “Evoy mn has tu teas" “John smith 1s 9 mon’!Ja: tel rita) denote Uy fg 'o man os HOO Legs" aka tet Tenn Sen pf the domain: Valid . Aigumenté ’ a step Reasow aka (HCH) > Low) prernis © 2 xD SD) ur fom ww p) ND premts © ») Ley modus ponens using ae | ond i) a fig Use the yuled of taference. to conshuck you'd. arga ment showing thot, the eonclusfore* eee or cesses the fist exons h™ not ocod. the book flows fyom tne porernis ed + boot’: gag not xeod the a the Hast exam. oss) BOD) pei denote Ya Student fn this clos. “royone Sh- tet ctw denote denote “x has read the VX passed the fist exam: premises an ir trig class Passe \ SIO) this al book" gna. r Fish we translate the. ad concluston into Symbolic foun. 4r( ctx) —> 86 vn (ce >. pf gesy: fel Mlx) denote “% too man” ands ton) \ os boo te te ; PDE 9G P gS And Let Toh smuitho be a member of the domain. ’ t+ : m ry Valid “iqumenti Step "Ragen aka (Mex) > LOO) paeene ) ut Ly) ot fom OW » NCD prem{is & py) Ey) modus ponens Using cay | and | e to congtiuat CL | | | fa We the yules of ftaferenc yolid Argument Showing that, the conclus fore! passed the fist Crom has not” trom the premises } hag not xcod the book’: “Smeone Who ocak the book ™, follows YA Student in this class “2venyone in tats class passea the rst exam. SO tet cen) denote “% iS in this class") & UW) book” end pray denote denote “x has read the UX pasted the fight eXan”: Fish we tramlate the premises and conclustom into Symbotfe form. aie Ct) B¢xy) a (co) —> P cn) » 3x (Plx) aw BAD)Lc: Show that the premise Everyone 7 \ dismete mathematics alags has taken. az Conny Re Computey Scftence” and " Marta 1S a Sty be d _ tn thts Class“ imply the conclusion." Maria a faken a course in computor Serence’ . rf | Cor tet pew denote “% fa. this discrete othemof, | dloss and ctx) “ahos taken ao course fn Compute, | Stence”. The premise aie 4x COlx)-7 ctx)) Ong | Olmorla) and the Conclusion fs ¢ (maria) Step Reason DF 2% Cd(>,.00%)) premise i 1) DComenta)->.¢ (eaerta) , Universal tastontotion fom W } 3) pcmana) Premise ' i opr iy ctmaxta) Medus ponens flan (99 9nd (3) i Bx Cem 080) Ax (Ccx) —> 9%) Vali'd *rgument s Shep Reason 1) 4x (cor Aw8(%)) premis & a) Cla) AWG (a) et fiom U) 3) ¢ta) StonptiftcaHon, Flom ada (cpm) Sa9) p@an 8 (0) cont forma, £6).4°P 4) 92 (pea) AeGl) , Co, fom sr peaseth 1-9, atx (man(%) —> moitot (0) Han ( Socrates) Mortal CSfocrotes) volid trquments slep w Fx (mon(x) > mortal(y) Premise PE @ Moan (Socrates) —s mortat vE fom WD CSoerates) Reason & man Clocvates) Premise & Morbar CSocrates) yp fom ( and @) universe Modus penens combines univers at fostant -lation anol modud ponens into one yule: fx (pen) —> OU) Plo), where g is a particul — ho oi an element in the