= oe ae Park-8 Predicate calculus: 4Te stolements "0", "X44-5 4% iets ; 1 XAG5 “Keys” ave they true oy Folse , when Sof the variables ave net specified : ec The stotement “2% 5 greeter Wan wo" is dented by PO) and ie called te propesitiomd function ot x - Were % fs subject ord "(6 quater thar] fo’ ts predicate OW value hos been assignal to the vowable x, the statenait POO becomes @ propositfon & has truth values & The logic based on the analysis of predicates In any | statenent (called predicate logic 6) predicate calculus | BJ N-place predicate a Neplace predicate is a predicate yeguming “ny” denoted by PCA) 42,93. ao) whee a. 4a, names. ot ckjects associated with the predicate and "P15 called a predicate names of objects vite | noo,and it is oy are the | a otatent functions Statement function of one variable: {simple statemen| Jon consisting OF predicate Eg “MOO it Function gyinia) and ah) ndlividual vavrable Ain eapyesss cormpound statement: Function = compound. statement mmoe simple Statement Functions Fg ma AWA) gunction is cbtained by combining two oy using logical connectiees AN, T wo. vavidbles = yf a predicate syatte’ Yoriobles Ey, Guy) 1-H 1S taller thay 4 quantifiers * Some neh ave clever” i ‘stokement —Fartetton of an expession consist y and two todiviclual | 4 Write gyynbool | For sing MOD: 1 1s men COD: 7 is CRE Symmbotie form: 3x (NO) Aad)IE 5 LLL 5 Find the truth vale of 6) CPC VAG) with POY L=1, et) x23 and he Uninese of discourse (8 H=GU2y Given: PG): 121 OY): 1=2 Universe of discounse A= ht2y tet %=) , POD 21=1 , Tue % OO: 142 | False Wee ver, Pa) 241, False 2 @(1) » =a, Tue Wow, (PEI Y GO) oo) Po v@)| =TVF aT GO [P@ v ae) ] =FvT 5T co. Tuth value of OO (ROD V GOD) 1s Tue 6- Partiolly ovdered set - nett A Aogater with a pastial owed velation Ris called Partially ovdeved set oy poset Ke: The gfeata than oF equal to (%) velaticn is the partial | oydeving on the set of integers Fy sing | 8) GEG, for WeY inlegey Oo, le: > is reflerive b) O>b ant pea BH A=b ie- > is antisymmetric | ©) arb and boc = arc fe Zs transitive KH Thus (2,2) is 9 poset 1 Draw the Hasse Diagrey for Dap Dao = HY, 415 10,04 (15), (09) (ioy) 1 (10,20) Go, 2) 4@ Now, R For Hasse diogram, RAG Ca), Ga, Bead, (2-4), (ula), (105) Leste) » (5110), (10/20) 4 Dao = hl 24,5110, 204 a= hG yd, (029 005). Fe) (130) , ad, (2/4), Gnd, (29), (4m), (4.30), (535) , (19 GAD), (oto), (19,26), (20730) § Now, R fo Hose diagram , R= h(a) (HH) » (24), Ono), (4,20), (5 19) 10129) 3 20 & Hien on example oF a elation whih is symmetyic, transitive but vot yeFlexive het ge Aas By | the velabien defined on R= HO Det d, (dy | Sine (212) ER, HB is woh yetive ie is symmebric | Let (ua) ER and Caer, Cray eR ond (AN ER also (DER, - ik is onsite awrite down the power Set of 3 for the aaa given S= 2/29 = LR, yay, Py, Ve Faay, Wy. qiasy 4] Ved = Tom cs mre yA lattice whith is complement and distributive is caled a Roclean Algebra awe B is wea Ton-enpty set with wo binary operations + and » distin€ elements. @ and 1 and a unoxy element 4, then B is. calledaq Boolean algebra, 1F it holds Tdeatity law , Comatutative law, Asseclative low , Distritute tow Complement (aw fev all Ob CEB Port -B ao: show that the —velation X44 defined on the set of integers partial ower relation isa ls Partial order relation A yelotion R on a set A Ve OR 1G ePlexwe , aubisymimetyic is called a partial ordering o postial order elation, nid transitive Reflen Given Relation. Re * a =b tet ast, ber 142; 16%Riso 2 £4 The conditin x4 y adkisties omy Whe a=b Tk is antisymmeyic “Transitive ak and bRC =D ARC tet ast, b=2, C=3 tea 5 1k asa) 2€% Aso 1437 26% Te is transitive sine, the relation x4y detined on the set of integers satisfies the mee conditinns, WES pontial oder Yelotion 9. Shute and prove Deworgarls law oF Reoolean Algebya DeMorgan’s law Te -enpains that the complement of the product of alt tems §«§ equal to He Summ of Complement of each term (ab) = a+ ae complement of ‘we sum of Ue all tem is equal to the product of the complement of each tem (arby'= ab Pook . rf y compement of %s ‘then by definition. We must show thet = wYet aN XY 06 iN (ath)! = al-b! (orb) +0-b) = (arbta'). (a4b 48) ‘ofetvibulave law) = (asa! 4h) + Commutative lous “ants wn iB )y syoclO lie ie = (tab) « ( ni) Complement lat = ()-Q) Dominarne 140 =| —-@ Tdentity law aay et A4b) -(o'b) = (ob) + (b-ahb') Distubutive !aw Ql) 4 (b-b'-a) ug” Commutative (ow (aa)b! 4 (bh'):0° Associative laud (ob) + (o-a Cognplement low = (6) (0) Dorninane (aw | =o -®© denlity lows LY =O i] @b' saat 2 (a-b) + @'+0') valtb') < (aleblyb Sg Cate aeD a Distvibutive fw ena Baal = OO Domirone law E =o Tdentiby law ty = Ve —6) (xb) s(a'sb!) = (asbea!) + (add B) Distributive law Seep yom as et 7 0) Complement low, = 0 +0 ‘Dominare law =o Tentity tou xy-0 - 4 | From @2 Q aris ob Fron @ %@ Cony = aleb! teme proved@ We Prove that evry chain is a distributive Lottice EHNA gost in whi ony tue elenters ove Foth LUB + 6B Chain: W poset in which any two elements ae compayable distribute Lattice: A Lattice thot sokisfies distribubive law WY \atkice does rack hdd distiibutive only 4 satisfies tak (Lid be @ chain) TP Lis o distvibukive lattice T] ve Lettice WILLS distributive low fab abel eithey ach (oy) baa tub Farby = b Jub §arby =o Gib Faby =a Gill Garo4 =b © © Fon Ox © Gow} hos both we + lB cb Is a Lattice tet us check L satisfies distributive low \et orb,c EL Distributive laws JO v(bAc) =@vb) A(avC) fi} a A(bvc) = @ab) Vac) ance Lis @ chain, we have 6 cases Tasbec iagcebh wi bsace Wibscga vicsagb viJegbsa ase} acgbsc Tay bad = @v) A (ove) -© -av(bAd) = (Vb) =b -O@ RAS avb) A(ave) = bAC = b -© Fon O*® ® pov #1 aagyey = @Ab) v OAC) IWS aA(bv) = GAC = 4 -0 aus (ard) v(add) = ava =a -@ ® poe Bey chain 6 dietvibvutive (oittice -fil Similorly » ene proved 1+ Prove that the intersection of two equivalence yelation 1s an equivakne | Yelation - | if | We have to prove intesection o equivalence velabions an a set 1S equivalence fet us suppose R ond S mre 2 equivilence yelatios cn a set A | Go set fraps Ras FS also equmvalende ER > (K. TER) and (x, 168) &~) Ee RNS ew RMS is veflexive Now (Ky) € RNS Guy) ER and Ky) 6 Gey) ER che equivalence they ave symmetric also GA) ER and (HES | Cur ERNS RNS (5. syrmebuc Finaly Caenns and Giz) RUS GER and (7) ER 3 CHIDER@ yes ad (yides > (MaDeES eR is transitive and 's! is transitive, RS (6 transitive SLRVIS is equivalace yelatlon ie Trkersection of equivalence velotion get is equivaletne lo Daw a Hose disgiam of te Lotice L i alt “the bulls @ taivel andey intersection and union . Sq -fowc§ sq =hbicy = Korb) aq hd aid sb} \ Ly = SiS? Sade} 18 0 sublottice of Ly by tre argument US, = So EL 91 US4 =Saey Si SE > KEL $2 US4 = HEL SUS, = Seer S4US = SOEL) \ Thus ty 18 elosecl under the option 0 Wow, SNS. >) ELy SNSA= SEL, | SiNS¢= SHEL \ Sa Ny =Siely | \ Song = 506k | Ga nS, = Sa ElyiC) Ths Ly is cleged under Hie operation 1) + Jet us ve caisider Ly =§Si55, St S34 7 Sm $1 = beSzgba -Hence La is nota sublattre Fu (5 Simplify the Boolean Expression ( (ay +%) + (41433) - x). Xa | lay Establish the validdty of the following ongurnent “AML integers ove | Wotronal numbers » Some inkegers are Pues cf a Therefore some yarienal | | snummbers fe — pues of 2" UA) L is an integer R@®- % is O vational nubs PO) © iS power of Q Prams: Ve IMIR) 7 FX LTO avg) . condusion. 34 [ROAR : =ay fay Rasy say fort} fish @ Premises DVO) [z02 RG) a xy) 3 RY) sj ax[t@a ro) ay Uy ara) sy xy) ey RW) sy PW) a} RAP) 9) 3x [RODAPCD) Rule P Rule 0S Rule P Rule ES qule T, PAGS P Rule T, Madus porers, Rule T, PABA G Rule T, HAD PAG Conjuction) Rule EG (3 Tet tie validity of the Following congue: i aes@ va Prove thot 3x (PG) 3 HOO) > *fPODA ats) Stags i Steptvo Premises Reason uy \ 4x Xa) 3% &) Rule P ayy | > | 1 axte vy £@G) | alert, P5G-) 100 Qa 3] va ana) v xaG) | Rule Ttvegation of Guorktty Ray A 1 P@)V Qa) Rule OS Gah 5 P@) 3a (0) Rule T, PG 1PVQ | ae Nx [ry 9a) Rule UG | \ —————— eo ee Ww se indect riethad GB proct te shone tra (PCA) Vacs) => 6) Ma) v 3x6 \ steps st invelved | . Premises Reawn 4 \- = [od PO) V Ix any} Rule P, Additional Premises KY a 4 LK) A 1a ley) Rule Ty paMorgant law hy s a 1) A Vx 7A) | Rule « Negation oF Gudnthes aw | + 4 10) RuleT, EunpliFecoion PAF | wa] = aC) | fue ES | hay | 6 ya VOM) | Rule T, PAR DQ hoy | 1 71 QC) gure US sity | 2 P(e) 4 1a(0’ Rule T, Wnpction | Rah q + LR) v On) | aude T, DeMlovgan’ law | Guy | ie ac YeCa) ¥4OH) J Rule & gus | Pf ¥ a) Rule 05 | : 1 faa} cn + [o) v a(o)| INTO Rule T , Conf ction | Ault. | cy Fr negation law \