\CH7 Truth Tables Trath tables prove a way of tralwatiig, Seotenas and arguments un SL. A complete Trute table considers wey pose outcome of an txpression in SL Crameety Gre Tare he TR a compute tute table has n difeent sentence leHes, Yen it must have 2° rnc, Fert latter Cleft most’) Number of Tract = number of Falier = 0,8 of 2%. Last letter Crght most) Will always Gonsict of alternatiy Tats and Flces Ow Sete lettoe rows = 2 2 2, aal> number of TS > number of Fs = 0S x2 =] Two Sentene letters 2 seo ws = te 4, nomber of TS > rmber of FE > 05K 42 antl nanle We can also fepresent fe table wath (S and of TA Fro AB v[t ilo o\l elo Tree sertena letters * tows = 27ananassae aaaannadzZ na nanny A complete truth trble Coxtans Every Postrble Combnation of Tres ¢ Fae’ te Tre Centence letters. 1 . Poca) te connectives from OL A [7A A 8 ANS AvB A >B AB T | F TT OT T T T T elt TOF F T & F eT fe T T Fe e oF F e T T Exenple Gasteact De Complete truth table fr te oxpression: oe AT)? W <_ o> Connecti AL a A iat @at)y a4 fee comectng Wat is eupated = Z lack is bnown as fe mam tT OT T T T Connechwt. Ths computaton + F 1 f F t povides be final result of T T 104, e Ff fF \FlF F be_aagecs Teatology Example Construct he Complete trate tale fav: CT Ccecy > cJa 2(crc)( Tastolen: + OR sentence is a tantolo Contrack chon c| (lc ec) > o) nlc sc T TIT TT fe ttt F e Te f€ € fF € TE Conteadichron Example Constenct te Couplele Tate table fr: Ma (NvP)> «oo mn PO MA (NY Vv Pe) T TOT T TTT 7 OT F T T TOF TO FT T e TT tT FO F OT Fo FF FoTT Ff TTT £ TF EF TTF Foe T f ett fF Fe Ff FOF F Gontrgent Ja terms of Tre Tables: 14 tn SLAG DE Column under its main Connechue Te Ton everg vom” of complete rth Fable Gnverce\y , a genkowa is a ConTradichon m SL if te Glamn under he wan coaneché § F on evemy row of a complete trate ticle. ent A Genkence 1S Contingent im SL iP i is never a tanksl A Contradiction 1c. if tt is T on atleast ore row and on aeast ont tow.Lepical Equivatence wre Toate tables es Tre Sentences art legen equivalent 4 GL af he hat be Sane tral Value on every tow ee Compete trate table Example Consider tne sentences 7 (AVR) and FAAGB Pre trey legeally equwvalent 7 oe * 2 A @ 72ve) Ahn EF tT 1 FT efe es. Trey ane legecalt TT o@ iF Tt Pe ee Sentences, 2 a8 er Tt F ee _J, Same Conasstuncy, A stk of Centences are len cally Consistent om SL iF tere is atleash ome row of a Compete Tath te on which all te Senknees are tree, Tr © inconsistent otrermiee . Example Determine wet te stk of Sentences are Consistent ar tnconsiGtent APA , 7AP7A, AAA AVA A>A 2A >2A aE zh Tr ts Consistent. F T t F FMalia 4 Bn orgament is vad ia SL if Cee 6 no row of a eee Kant tebe on Which” Whe gremaises are all T anh Une conclusion is Fo, on argument i wavelid va SL af there iC Suc a row, Corser Was argrment pose Ll > Gvy if T yensu 92 T ny hen ast F Ts ib vols? su aGvr a 5 TS Veta! + amis (4 ana7 dle t 7 a7 Exangle Ts te orpament Valid? AzB g LA > RB ADB aw mH? = = Exangle Ts 1k vald?Vr LeOr Pes ee 2 > o > < © eo le io 3 > ° > a L444 | ana44 Aaa. | an) ay Tavatid aan 4st | aadta27ds |e alain [0 at Eel 44 aa Partial Tnty “Tables Fone hate te opecson (UAT) > (Saw) We want to prove it is nol Lantelegy 2 We eed on row Showings Le expression is F, — S TU WwW CUAT) 9 (SAW) 7D parted fete Hele “Oa a 46 = 2 prves et Ie O a q = s a tautolog) Or tT ¢€ =r F € Gor proving, iF ic A contend 1 We necl 2 Peas 1 Showing one T 4 on F — ¢ TuUW @aT) > €aw To aT € Fee {T_T T T Contingent Tr tas wo My WE Gan ASE parkral oF complete tnt tables te prove or disprove wbolagses , Contradichns, Contents, lepierl eqmvolance , Validity % censiskener,