EE Truth Tables, Equivalent Statements, and Tautologies Truth Tables 1m Section 3.1, we defined truth tables fr the negation ofa statement, the coaunction of two statement. and the disjunction of two statements. Each ofthese truth table is shown below for review purposes. Deaton Conjunction Disjunction ? P > [Pag p_« [eve efor rorle tori eo otile For] or re rile roel er YY Truth Value and Truth Tables ‘The truth value ofa simple statements ether rue (T) or false (F). ‘The truth value ofa compound statement depends onthe truth values ofits simple statements and its connectives. A truth table isa table that shows the truth value ofa compound statement forall possible truth values ofits simple statements “Tru Tbe for~p “The negation ofthe statement “Today is Fiday”is the statement “Today snot Friday” Insymbolic loge, the tilde symbol ~ isused to denote the negation of statement. Ia state 2 |e ment is te is negation ~p is false, and ifa statement pis als, its negation ~p is rue. TY. F See the table at helt. The negation ofthe negation ofa statement isthe orginal statement eit Thus ~(~p) canbe replaced by pin any statement If you onder cake and ie cram in a restarant, the waiter will ring oth cake and arene Joe cream. In genera the conjunction pq is true if both pan q are true, and the con- aha §uneion is false if either p or gis false. The truth table athe ket shows te Four possible rr ass that arse when we fem a conjunction of two statements F . YY Truth Value of a Conjunction ‘The conunetion p “gis true if and only ifbothp and g are true Sometimes the word bus used in place ofthe connective and. For instanc my bike to Schoo, but I ide th bus to work," is equivalent tthe conjunction, ike to whoo! and ide the bus to work” ‘Any disjunction pq stu if piste orgs tue or both p and are wue. The truth ale at the left shows that the dljuction p rq is fale if both pan gare fase, re REE however tis tru in al ther eases ride my Dua = YY Trath Value ofa Disjunction 7 ‘The isjunetion pV qis re if and ony if pis tr qs re, or both pang areIn this section, we consider methods of consructng truth tables fora statement that in voles a combination of conjunctions, dijunctions, andlor negations If the give statement involves only two simple statements, then start with a table with four ews (ee the table at the lef called the standard truth table frm, and proceed as shown in Example 1. ares tt tates Sundar rch ble former agven 3, Conse table for (pV) @ ‘amen a voles ony te 80 Use the tra table from part ato determine the uth value of ~(~p\V q) V qs given . — that p is tre and q is false. Solution 2 Start withthe stndard truth abe frm and then include a ~p column, [Now use the truth values from the ~p ang columns to prodiace the truth values for ~p\/ 4. as shown inthe rightmost column ofthe following table, p 4 [=p “eve T T/F tT oFi|F F Fori|t 7 Forli[t ot [Negate the truth values in the ~p \V¢ column to produce the following, pg | eva ~eva) 1 T/F T tT oFiF FOOT pol? TOF FoF [tT TH As ou ast ep, we forthe disjunction of ~(~p\y wih and plc the esis in the rightmost column of the table. See the following table. The shaded column is. thet table for ~(~p V9) Va pa [Va rye) “ervalVe T TIFT F T |rovt TO oFi[F oF T T |row2 rFovilt or F T |row3 Forl([t or F 2 1 tnrow 2othesbove eth ble, we ee that when p ste, angi ae he te sent —(~p\/4)\ in the ighmo clan is te.Ginn Compound statements that involve exaetly thre simple statements requir a standard statement | tte fom with = Bros, os hovaat th et fmm Truth Tables r T F T F a, Construct a tmth ube for(p/\.g) \(~r \¥q). y F T F b,Usethetnth bl tom pr at deere te th veo (pg) \(>r Va elven tht piste gist adi Solution a. Using te proces evlopein Expl, necn produ follwing ble. The shal eons teu able arp g) (mr gh Themes in te eee. sures below te columns dee thon in wich te olunas were consruct rection Each vain column mune sth conjunction ofthe rests lente comes me | and pogo lpg re (pAg) Ara) + T T T F z T row T T F T x = T row ¥ F : F F F F row 3 T # ¥ F F z F row d F T z F F = F row 5 y T F F T E FE rom 6 F F T F F F F row 7 F F F F s T FE row 8 @ @ {] . Inzow 2 ofthe above ith thle, we se that (p \ g)\(~r\V/ g) stm when pis tre, gist, and ris fae‘Alternative Method for the Construction of a Truth Table In Example 3 we use an alternative procedure to construct a truth table YY Alternative Procedure for Constructing a Truth Table 44 Ife given statements. sip statements, thon star wih standard form that TARENOTE LT | tes Pro tert ru aes orca singe seen and hi tos ——___ 5 | 2, use truth vahes for each simple statement and tbc nation to enter the crt valves undereach conectve within a pair grouping symbols, nel ing paetieses (brackets [ Jad brace [ |. 1Feome grouping sibs are Tae aerate proses orca rong sl len dered denise generally equles ies we trig gee ems wrk- | edie clr grouping syabal then wot fom eae ot. any ea eee | ution in which grouping symbols have not been used, then we use the f- eoeoatiart Towing order of precedence agreement First assign tu alas to negations fom let right, flloed by conjun- tions fom It righ, fellowed by disjunction frm orig flowed by cntonals from ft to ight, and finally by biconionas fom to igt. The rath vals that are etre note column under the connective fo which truth values rosie a, frm the trth able forthe given seme. EEDA Use the alternative Procedure to Construct a Truth Table ‘Construct a truth table for pv [~(p A ~q)]- Solution Step 1: The given statement p\/[~(p /\ ~g)] has the two simple statements p and g. ‘Thus we start with a standard form that has 2" = 4 rows. In each column, enter the truth values for the statements and ~q, as shown in the columns nam- bbered 1,2, and 3 ofthe following table. aaaals aaa ale Ella = 44s Baa aleStep 2: Use the truth values in columns 2 and 3 to determine the truth values to enter under the “and” connective. See column 4 in the following truth table. Now negate the truth values in the column numbered 4 to produce the truth values in the column numbered 5. Pog iPr Vi ( A ~o) tT T/T T 2 RF ®F DoFIT F.rdTdq FT| F TOF FOF F FF TOF FT L SJEHG Step 3: Use the truth values in the columns numbered | and 5 to determine the truth values to enter under the “or” connective. See the column numbered 6, which is the truth table for p\y[~(p A ~g)]. Pog |e VE A ~) zt ori[a byt tf T F/T TRTOTT F T|F TT F FF FOF|F TT FFT