: °c f f CEL P>¢@[7>P | paq y e 7 ree See po F a mi . ae Tb | Table (6) " From the table it appears that p <> q is true only when both both p and q are false. 2.7.2, Conditionals related with a given conditional. ~~ Let p > q bea given conditional. Then i) q> pis called the converse of pq; ii) '~p >~ is called the inverse of pq; iti) ~q >~ pis called the contrapositive of p > q. To compare the truth values of these new conditionals will draws up their joint table. P ANd g arg ‘those of D+ = ‘ aaa Converse | Inverse Conga ~p | ~q Pq Cae shad ~q>uy T © iL W F T ty FP Jy F F T els + ar i Table (7) a) a }afals mala] a fs Sfa)a}a a} } aja From the table it appears that i) Any conditional and its contrapositive are equivalent therefore any 8 may be proved by proving its contrapositive. ii) The converse and inverse are equivalent to each other. Bssample 3: Prove that in any universe the empty set ® is a subset of any set A Let U be the universal set consider the conditional rst proof: re UXeD XE A " ) ‘he antecedent of this conditional is false because no xe U , is a member of @ Hence the conditional is true, as proof: (By contrapositive) The contrapositive of conditional (1) is wWreU, xt AXED ns The consequent of this conditional is true. Therefore, the conditional is true. Hence the result. ixample 4; Construct the truth table 0! /(p > 4 - p> q)] jolution: Desired truth table is given below: - P q Pq \(p>qap \(p : ‘| p>) T 7p , gi T iT F F F T apated oT lea F T me 7 F T Table (8) le, p2qge(~q-~p)isa tautology. already ame truth table ) __ A staemenie which is"always false-is called an absurdity or a contradiction eB, P~p(x) is true). ¥xample S 1) ae A, periis true, (To be read : For all x belonging to A the statement p i) Bee Ad p(a)is true. (To be read : There exists x belonging to A such that statement p(x) js trug @ 1. Write the converse, inverse and contrapositive of the following Conditionals. i) ~p3q_ ii) qo>p eer iy) ~q5. 2. Construct truth tables for the following statements: - ! ) (p>~p)v(pq) ii) (pa~p)>q mM) ~(p—>q) > (pra~q) 3. Show that each of the following statements is a tautology: - - (PAQ) > p li) p>(pvq) rie ~(p—>q) > p WV) ~qA(pq)>~p . termine whethe: till dant ether each of the following is a tautology, a Contingency or an i) ~ ii PA~p i) p> (q p) iii) av (~qv p) PA ~q) 5, Prove that pv (~ pa ~9) ¥(PAQ)= pv (~(nN a Chapter. 2, esoutan Sets, Functions and Groups 2.8 Truth Sets, A link between Set Theory and Logie. Logical propositions p.qetc., are formulae expressed in terms of some .s. For the sake of simplicity and convenience Wwe may assume that te 2 expressed in terms of At sae i iable x where x is a real vaubie i p= Po) where, ¥€ i. those val ues of x which make the formula p(x) true form a set, say P. Then P is the truth set of p. Similarly, the truth set, Q. defined. We can extend this notion and apply it in other cases, i) Truth set of “Pp: Truth set of ~p will evidently consist of those values of the variable for which p is false i.e., they will be members of P”, the complement of P. ) pva: Truth set of PV 4 = p(x) v q(x) consists of those values of the variable for which p(x)in true or q(a) is true or both p(x)and g(x) are true. Ta variable: of q may be Therefore, truth set of pv qwill be: PUL@ = {x/p(a)is true or q(x) is true} ii) pg: Truth set of p(x) q(x) will consist of those values of the variable tryjfor which both p(x) and q(x) are true. Evidently truth set of PAG=POQ 4 = {xl p(x) is true A q(x) is true} iv) p > q: We know that p — qis equivalent to ~ pv q therefore truth set of pqwillbe P'UQ vy) p © q: We know that p patavn=(PAgy (PAT) We construct the table for the two sides of this equation 3.4 @ 6 7 8) pla r ar patqvr) | P* par (PAQY (par‘ : : iscsi Chapter. 7 ; 2: Seu. Sets, Functions and Groups ai 5 2 j va ty Convert the following theorems i oes s to logical form and prove thi em by constructi 1. (ANB) = F ’ = | * pws 2 (AUB) UCHAUGUC) 3. (ANB)NC=AN(BO C) 4 Au . (BAC)=(AUB YA(AUC)