@) Application of TR THLE ord Orguments Fremise 1: IF ome loves MMW, the he lover he matte, Premis: 1 We loves MMW ne toves Mabhernalics Aequacny Fou ram v TRU teu FORM [en ar]— ™ @ a aa nne.ot vari _ o FOG as entte r 7 ? ene [yarlon r ‘ t hi + ' Fe Ror of ' : y Tautalogy *Wolid —+@) AvP 9Q Poa PrO ~P (PrO)ArE aq Eerwaynn~e] + ~8 rT Tt fi : “ TR of F F + r eT v rT + : FE pF T 4 T t ? pe ronnt Faleoy lortingercy) ‘Ivo Loqio\ eqdvolene pager (P--~@) [p08 ef q ~a PG pone (Oo ie a F E Tr E F T F tie £. 4 F ee f F F Fallacy (corbrmdich) sad YU LOGIC ~ “science of correct rmening” . nu classified meTRUE + FALSE, but rk bath. Ly PROPOSITLO digundion (or) negation Crk) TTT nize ¥ tVERT ape eT t FVEEE cordi.opel Gf. ther) Hondiineol G%) Tee eT oT gated = qatet yer err eT Fer tok ARGUMENT: fate Premges NS conclvsion Valid Inve Lossca. Equivalent ‘ rent ‘a Two Propositions (P,0) thubology fallacy the have the Some a Me tg cJ™ tru vatus wT nate Thee, Py Het on Agere PZQS & logical aves, “De equivalence apspasacke trrctte prey,@ RULE OF TNRERHOCE C14) Construct a formal proof of validity for the given arguments. a ~Q+R b. -RaP &. 4XQA=R)/ OR a ~Q+R Given (Premise !) b ~RAP Given (Premise 2) c {Qar-R) Given (Premise 3) dR Simplification (from b) & ~Qv~-R De Morgan's (from c) £ -QvR Double Negation (from e) g ~-Q Modus Tollens (from a and d) bhoR Disjunctive Syllogism (from fand g) Define the necessary symbols, rewrite the arguments in symbolic form, and then prove. If you will study hard, then you will pass the examination. Moreover, if you pass all the requirements, then you will graduate. Hence, if you study hard and pass all the requirements, then you will both pass the examination and graduate. Define the appropriate symbols. : You will study hard 2 E: You will pass the examination R: You will pass all the requirements G: You will graduate The arguments has the form: a S+E If you will study hard, then you will pass the examination. b. R=G Ifyou pass all the requirements, then you will graduate. € + (SAR)+(EAG) Ifyou study hard and pass all the requirements, then you will both pass the examination and graduate. Proof; a SE Given (Premise 1) h RG Given (Premise 2) & (S+E)A(R+C) Conjunction (from a and b) a. SE . Simplification (from ¢) 330 General Mathematicse S*E)V-R Addition (from d) f, ~RvG-E) Commutative (from e) g. ~RvCSVE) Material Implication (from f) bh. CRY~S)VE Associative (from g) i. (Sv-R)vE Commutative (from h) j ~ASARVE De Morgan's (from i) k R+G Simplification (from c) L R+G)v-S Addition (from k) m, ~Sv (RG) Commutative (from 1) a. ~Sv(-RvG) Material Implication (from m) o. (Sv-R)vG Associative (from n) p. ~SAR)VG De Morgan's (from 0) gq. THSAR)VEJA[4SAR)vG] Conjunction (from j and p) SAR) V(EAG) Distributive (from q) s. (SAR)+(EAG) Material Implication (from r) ‘The next example can be proven using indirect proof. In indirect proof by contradiction, we assume the negation of the conclusion we want, to prove. If this assumption leads to a contradiction, then this assumption is wrong, which means that the negation should not have teen assumed. Thus, the conclusion to be proven must be true. 2 Indirect Proof Given: P+~Q ~Q>P Prove: -P i Proof Statements Reasons 1 P+~Q 1. Given (Premise 1) 2P 2. Assumed (Negation of the Conclusion) 3 -Q 3, Modus Ponens (from 1 and 2) 4, ~Q~P 4, Given (Premise 2) iP 5, Modus Ponens (from 4 and 3) 6 PAP 6. Conjunction (from 2 and 5) sp 7, Simplification the conclusion. This assumption leads to In Statement 2, we assutned the negation of eee n that leads to a contradiction is false, then ‘Ontadiction in Statement 6.'Since any assumptio Conclusion to be proven is true. logic 331| List of Tautologies Table 7 Associative: for (v) for (a) (Pv Q)vR]—>[Pv(QvR)] (P,Q) AR] > [P-(Q-R)] 2. Commutative: for (1) (P~Q)—> (QAP) for (v) (Pv Q)>(QvP) 3. Distributive: for (a) (Pv Q) AR] > (PAR) v (QAR) for (v) [(P 4 Q) v RB] (Pv R) a (QV R) . Law of biconditional propositions [(P + Q)~ (Q—+ P)] + (P + Q) [Pa(P+Q)]+Q Modus Ponens [(-Q. (P+ Q)] + ~P 6. Modus Tollens . [(P , Q) > R] + [P+(Q—+R)] 7. Exportation . (P+ Q)-+ (-Q~-P) 8. Transposition or Contraposition ~ 9. Addition heey 9) 10. Simplification (PAQ)~+P Logic 309LIST 0F — THUTOLO G&G 13. Absorption (P+ Q)—+ [P+ (PO) (P.vQ)n-~P] +O 19. Constructive Dilemma [(P + Q)» (R+ S)]A (Pv R) = (QV S) 20. Destructive Dilemma [(P + Q) a (R- S)} (~Qv ~S)— (~P vy ~R) Each tautology can be verified by constructing the corresponding truth table.4. Identity Laws . Domination Laws 3. Idempotent Laws 4. Double Negation Law 5. Commutative Laws 6. Associative Laws ~(-P)=P PvQ=QvP PAQ=QaP Pv(QvR)=(PvQ)vR PA(QAR)=(PAQ)AR Pv (QAR) =(PvQ)a (PVR) PA (QVR)=(PAQ)v (PAR) (PA Q)=~Pv~Q (PV Q)=~PA~Q 7. Distributive Laws 8. De Morgan's Laws 9. Material Implication P+Q=~PvQ 10. Biconditional or Material Equivalence (P<+Q)=[(P+Q)a Q > P)) 11. Negation Law Py~P=T 12. Contrapositive or Transposition Law P+Q=~Q—>-P 13. Exportation Law (Pa Q)+R=P—+(Q—R)