Disonele math Che = Paeresiliona lagi + Paopocitional logic is he logic that deale with Paropositions and compound statements build fsem Simpler statements Using. Boolean connectives > Design of; dighal “clectsinic cimeuits —>_Expnessing Conditions im’ pragsiams —> Quesies to databace. g search, engines - AE Pmoposition- . 1 A psopesition (denoted by p.¢,P) 1S O Statement whieh is a declanelive sentehee with a’ ‘deSinite Meaning, : having a Value .of either Tmue om False. Ex Dhaka is the capital of Bangladesh. Cr), # Operaton 2 Aypes~ 1, Unang Operetos: 12, Binary Operates Single variable 2 voriable A 8B + g r= PAT F | aauv44 mandaBoolean Operatons ~ . Negation opetaton —> NoT . Unony 7 - . Condunction operaton —> AND, Binany s A+ Distunction operaten—> OR, Binony. Vi! Exclusive -OR operaton —>.X-oR , Binary . @- . Implication operalon —> IMATES . Binany, > . Biconditional operaton —> IFF. Ginany , <> + Not openaton - P| ae P=T hove brown hais. Thy ck IP =T dow} have brown hain, F u AND Openaton- PY] PAs TOT + “P= I will eat salad fos TOR tes lunch. F Fr 7 %= TX will eat cleak Pos ror | F 1 dinnen. + PA&=T will eat salad on lunch and F will eat steak fon dinnen.# OR operaton — r P= Mz can has bod engine %= My can has bad been Con bunetos Pv% = My Can hag bad engine, | { os: | My Can has bad Can buneton. \# Exclusive og — % | POY — Either oss P= Twill eam A inthe Counse. : 4 = FT, will daop this counge. POY: ZT will eitha eamn A in this Gomse, os T ¥ Cant be Choth) will dep if. Tue /Falee at a Hime:a |# Typlication operon — P= Vou study hand- 4= You will get oa goed gqnode Po%= TP you study hond, then You will get a good gmade. ASDF RPhsases also oan be uced— A. P implies q We is necessary fon P 12. 4 Allows Pmom P , 13 Gis implied by p. » TP Ps then® re PLY » When P.% Whenever P+ y if P f st Be to + when P N . F whenever P » P only ik & lo. P is suffictent fon 4% Tesrminelogy For implication P= & Fmelies , Te Pothen & (pq)! Converse + If 4 then P (q4->P)) aInvense > If AP, then 44 {oP a1) Contmapositive, I¥ Ae, then aP (44-5 7p) Tsiuth table wv Ww w Vv Pp yy Poy y—Pp aP—TG 44-5 AP tT OT aia a T T TOF F T 7 - F T, F) FE Say eae a als TE T 1 OCT So, Tmplication = Contnapostive Converse = Inverse| = P= Today ig Fasten | $= Tomosmow is Monday (“* tmelication CP) J i TP today is Easter then tommmnow ig ' Monday, & Oonvernse C4 —>P) IP +tomonsow is monday then today is Easter: i* Invense (He > 39) | TF today is not Easter then ee i not Monday. “ | Gontmapesitive (34 =P) IF +omomnow is not monday then today is Not Easter A Biconditional Operaton— CIFF) P= Th is below freezing Y= TA is Snowing PoOt= TH is below freezing if and only if it ts Snowingoe Pseve . Pee q- is equivalent +o (P34) A C4—>9). Also prove Pest is equivalent 40 —(P eq). > | Tswth stable : i tes we | P 4 (Peoq Poe FOP (PSYACA>P—) ay a a Tv T 7: |v F F F 7 F For F T Ee F FOF Tr + T + PF Peart 4 (P9) Posg TOT F T Tv TOF T F F For T F F FOF F T ale~\~ — \* Define. Inclusive OR and Exclusive OR. Inalusive oR — Fon two propositions P ond ¢ , pvq is true if |p igi true, 4 is Amue J both ane tnue-” | | | Exclusive OR- | Exclusive: OR leon +wo propositions P andd, Peg is tue if | either Pond is dave » but net both. | j | Tauth Table a4i47~ {Compound Paopositions — Precedence of legieal operalons — O, WAL au eS EP) ¥ (PM 44) > % Truth table — Po & 3% (PVH) (PVA) Sy a I eines ce TT OF T o TOF T a a For oF F T FOF + T F >* Let, P=T4 sined act night 4= The cpninklers came on last night > The lawn was welwel thic momming. [The lawn wasn't wet this mrenving ) on (it sained lag "Del (the sprinklers came on last ight) a0VP v41 Psopasitional tmetelgy Equivalence = > Tawtoloay. All sveault values must be Tawe Ex : Today the sunwill shine om today the ‘sun will no} shine. PoP Pwo, 7 + Foot T — Contadiclion All sesult values must be Falge. Ex Today is Walnecdag and today ic not Wedreclay., dz el (Nel) TOF FF FON, F riers —> Contingeney . Neighthen “Tnue_om—Falge-A simple Neighen Taudolegy on Contradioton. Nonvnal Propositional logic oud ped Must be compount proposition.| | P na 4 TiHo’wd |e i+ De Mongav's Law- Prove -> aYtpns = AP Vv AY {=> | Tsudth table | teen / : 1 ae (% aR aA TY PAY (PAY) ~TP VA Jo rhe © Tr a F }7t For %T TF iv im iFoT tT F OF iT T J FT. 7. Te T 7 { #' Paeve, P44 = AP V4 | Twdh table Po4 = 4P ve (Preved)| | | \# Dictnibidive Law > { | Pave, PC+rv) = (eva) AC PY) => auth table Poe ® FAP -PVGAP) BA PvE (Pe Ta eee sT. ae T T {TT F ie iT + + Tae oe T 1767 ee . T Ts 9 [So oe T T + ap ee z F (TOF EE F FE FE + Eee F F - K CPvd) A CPve) ay oo ow ot |# Equivalewe Laws— [Link]ée —> Pate p :pve=P 2. Domination —> PYT=T 51 PAF =F) 8. Idempotend —> PVP=P.5 PAP =P 4. Double Negation —> 1-+P = P B. Commutative = PYt= AvP pPrave¢np ul 6. Associative —> CPV4)VP = P VCO) CPAYAY = PACAP) 7: Distmbulive —> Pv (4aY) = (PV4) A(PvY) PA(4VP) = (PAY V, (PAY) 8, De Morgan's —s APA) = aPVay (PVH) = TP AMY 9, Absonp}ion —> Pvcpay=P ; PACPVH=P Cosmin variable multiple) 10. Tsrival “Tautolegy/ Contnad iedion > PvnP=T 5 PAP SF I. Exclusive ons POEs (PANG) VCP AH) Per = (Pvt) A> (PAY) 12. Implies, > Porg¢a Hpvy ee 12. Gieenditional > (Pays (P>4)n (49) Pot = 4(P eV)# Shou that, f (P34) and PAY ane equivalent. > ae f = (p59) | [expand ‘definition of >] =P v4) [De tergavs lew] ‘ Parent : : = ACP) A H+ '[ Double Negotion] =p Kaye ae = Ay | Wt Prove, | CPAG) > (Per) = Ap va. vp => 2 (Pa a4) a CPer) Lexpand definition of >] = 7 (Pn9), v.(per) [expand definition 0? @] = 71(P Aad) v (Cpve) AS (ear) . ; : [de Megan's Lav] = Gp 4) V ((eve) N= (Pay)) [v commutative] = © (e vp) v (CPP) A (par) [v Assistive] = 4v.(aP vy (Pye) an (PAr))) TDiskbide V over a7= 4 VCP v (rv) ne valenny) 1 Aside =e (Cap ve)dve) (Cap ve) Kee) paso “pyar =4v (CT ve) A opine) [Domination] ap vay. =4v (7A (ew) [Teentifa] atapay) =¢v(7P VA) [Asseciative] * = v aP) v7 [Vcommudative] = va = oP NY Mo (prwves) al Predicate Jogie— The Deg iS Sleeping. | Subject Paediaate In predicate logie, a prediete ig modeled as a propositional Function P(-) L—> X4,2--- | |] i Pte) = eis Sleeping (xe isthe subset) | Subdecde = X,Y, ---- Clower case) Propositional function = PLG.R ~~~ (vppen dase),| ) | it Universe of diseounse om) Domain of discourse. => a (46 Dy F The Collection of wolves that ‘x’ ean dake. we j ; Let, ie , Pox) = ‘+41 >¥ Here, fom any Number of = Pix) is drue. (a4a>4), (2+4>2) ele. # Buantifiens- Universal qualifier > V Existential Guanlifer > J Vx (Plz) —> Fos all ‘x! demain exist. x P(x) —> Minimum 4 value on domain fom Se exist. |# Free & Bound variable - Vx Puy) 5 Here, Free voniable is = Bound variable ic =»y Df) Paropesitional logic Pe & ,Page ~ 14, 16,-17,12. 19 (No Needed ) ia Every student in dks class has. studied | daleulas = Cae => Wx Cx) | | % Some Students in this alass has visited se Mexico. mlx) -> de mz) oe Every Shident in this class has visited either = Canada on Mexico. CG) mae => Wx (CCe) v mz)) of Not every Student imdhe clase has studied Be Coleulus - Ctx) => Vx CCx) Thene_is a student in the class buho has etudied caleulus. ~ (ae) => Qe C(x) Logically beth meanmgs ane Same. LE a vx C(x) = Jx 10cx)