1. Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic

2. Section 1.2Propositional Logic1 Deriving a logical conclusion by combining many propositions and using formal logic: hence, determining the truth of arguments. Definition of Argument: An argument is a sequence of statements in which the conjunction of the initial statements (called the premises/hypotheses) is said to imply the final statement (called the conclusion). An argument can be presented symbolically as (P 1 Λ P 2 Λ... Λ P n )  Q where P 1, P 2,..., P n represent the hypotheses and Q represents the conclusion.

3. Section 1.2Propositional Logic2 Valid Argument What is a valid argument?  When does Q logically follow from P 1, P 2,..., P n. Informal answer: Whenever the truth of hypotheses leads to the conclusion Note: We need to focus on the relationship of the conclusion to the hypotheses and not just any knowledge we might have about the conclusion Q. Example: P 1 : Neil Armstrong was the first human to step on the moon. P 2 : Mars is a red planet And the conclusion Q: No human has ever been to Mars. This wff P 1 Λ P 2  Q is not a tautology

4. Section 1.2Propositional Logic3 Valid Argument Definition of valid argument: An argument is valid if whenever the hypotheses are all true, the conclusion must also be true. A valid argument is intrinsically true, i.e. (P 1 Λ P 2 Λ... Λ P n )  Q is a tautology. How to arrive at a valid argument? Using a proof sequence Definition of Proof Sequence: It is a sequence of wffs in which each wff is either a hypothesis or the result of applying one of the formal system’s derivation rules to earlier wffs in the sequence.

5. Section 1.2Propositional Logic4 Rules for Propositional Logic Derivation rules for propositional logic Equivalence RulesInference Rules Allows individual wffs to be rewritten Allows new wffs to be derived Truth preserving rulesWork only in one direction

6. Section 1.2Propositional Logic5 Equivalence Rules These rules state that certain pairs of wffs are equivalent, hence one can be substituted for the other with no change to truth values. The set of equivalence rules are summarized here: ExpressionEquivalent toAbbreviation for rule R V SS V RCommutative - comm (R V S) V Q (R Λ S) Λ Q R Λ (S Λ Q) R V (S V Q) Associative- ass (R V S) (R Λ S) R Λ S R V S De-Morgan’s Laws De-Morgan R  SR V S implication - imp R (R) Double Negation- dn PQPQ(P  Q) Λ (Q  P) Equivalance - equ

7. Section 1.2Propositional Logic6 Inference Rules Inference rules allow us to add a wff to the last part of the proof sequence, if one or more wffs that match the first part already exist in the proof sequence. Note: Inference rules do not work in both directions, unlike equivalence rules. FromCan DeriveAbbreviation for rule R, R  S SModus Ponens- mp R  S, SR Modus Tollens- mt R, SR Λ SConjunction-con R Λ SR, SSimplification- sim RR V SAddition- add

8. Section 1.2Propositional Logic7 Examples Example for using Equivalence rule in a proof sequence: Simplify (A V B) V C 1. (A V B) V C 2. (A Λ B) V C1, De Morgan 3. (A Λ B)  C2, imp Example of using Inference Rule If it is bright and sunny today, then I will wear my sunglasses. Modus Ponens It is bright and sunny today. Therefore, I will wear my sunglasses. Modus Tollens I will not wear my sunglasses. Therefore, it is not bright and sunny today.

9. Section 1.2Propositional Logic8 Deduction Method To prove an argument of the form P 1 Λ P 2 Λ... Λ P n  R  Q Deduction method allows for the use of R as an additional hypothesis and thus prove P 1 Λ P 2 Λ... Λ P n Λ R  Q Prove (A  B) Λ (B  C)  (A  C) Using deduction method, prove (A  B) Λ (B  C) Λ A  C 1. A  Bhyp 2. B  Chyp 3. Ahyp 4. B1,3 mp 5. C2,4 mp The above is called the rule of Hypothetical Syllogism or hs in short. Many such other rules can be derived from existing rules which thus provide easier and faster proofs.

10. Section 1.2Propositional Logic9 More Inference Rules These rules can be derived using the previous rules. They provide a faster way of proving arguments. FromCan DeriveName / Abbreviation P  Q, Q  RP  R Hypothetical syllogism- hs P V Q, PQDisjunctive syllogism- ds P  QQ  P Contraposition- cont Q  PP  Q Contraposition- cont PP Λ PSelf-reference - self P V PPSelf-reference - self (P Λ Q)  RP  (Q  R) Exportation - exp P, PQInconsistency - inc P Λ (Q V R)(P Λ Q) V (P Λ R)Distributive - dist P V (Q Λ R)(P V Q) Λ (P V R)Distributive - dist

11. Section 1.2Propositional Logic10 Proofs of inference rules Prove that (P  Q)  (Q  P) is a valid argument (called Contraposition – con). Hence prove, (P  Q) Λ Q  P (using deduction method). The above is true using the modus tollens inference rule. Prove P Λ P  Q (called Inconsistency) 1. P hyp 2. P hyp 3. P V Q1, add 4. Q V P3, comm 5. (Q) V P4, dn 6. Q  P5, imp 7. (Q)2, 6, mt 8. Q7, dn

12. Section 1.2Propositional Logic11 Proofs using Propositional Logic Prove the argument A Λ (B  C) Λ [(A Λ B)  (D V C)] Λ B  D First, write down all the hypotheses. 1. A 2. B  C 3. (A Λ B)  (D V C) 4. B Use the inference and equivalence rules to get at the conclusion D. 5. C2,4, mp 6. A Λ B1,4, con 7. D V C 3,6, mp 8. C V D7, comm 9. C  D8, imp and finally 10. D5,9 imp The idea is to keep focused on the result and sometimes it is very easy to go down a longer path than necessary.

13. Section 1.2Propositional Logic12 More Proofs (A Λ B) Λ (C Λ A) Λ (C Λ B)  A is an argument 1. (A Λ B)hyp 2. (C Λ A)hyp 3. (C Λ B)hyp 4. A V B1, De Morgan 5. B V A4, comm 6. B  A5, imp 7. (C) V A2, De Morgan 8. C  A7, imp 9. C V (B)3, De Morgan 10. (B) V C 9, comm 11. B  C10, imp 12. B  A8, 11, hs 13. (B  A) Λ (B  A)6, 12, con

14. Section 1.2Propositional Logic13 Proof Continued At this point, we have now to prove that (B  A) Λ (B  A)  A Proof sequence 1. B  Ahyp 2. B  Ahyp 3. A  B1, cont 4. A  A3, 2, hs 5. A V A4, imp 6. A6, self

15. Section 1.2Propositional Logic14 Proving Verbal Arguments Russia was a superior power, and either France was not strong or Napoleon made an error. Napoleon did not make an error, but if the army did not fail, then France was strong. Hence the army failed and Russia was a superior power. Converting it to a propositional form using letters A, B, C and D A: Russia was a superior power B: France was strong B: France was not strong C: Napoleon made an errorC: Napoleon did not make an error D: The army failedD: The army did not fail Combining, the statements using logic (A Λ (B V C)) hypothesis C hypothesis (D  B) hypothesis (D Λ A)conclusion Combining them, the propositional form is (A Λ (B V C)) Λ C Λ (D  B)  (D Λ A)

16. Section 1.2Propositional Logic15 Verbal Argument Proof Prove (A Λ (B V C)) Λ C Λ (D  B)  (D Λ A) Proof sequence 1. A Λ (B V C)hyp 2. Chyp 3. D  Bhyp 4. A1, sim 5. B V C1, sim 6. C V B 5, comm 7. B2, 6, ds 8. B  (D) 3, cont 9. (D) 7, 8, mp 10. D9, dn 11. D Λ A4, 10, con

17. Section 1.2Propositional Logic16 Class Exercise Prove the following arguments (A´  B´) Λ (A  C)  (B  C) (Y  Z´) Λ (X´  Y) Λ [Y  (X  W)] Λ (Y  Z)  (Y  W) If the program is efficient, it executes quickly. Either the program is efficient, or it has a bug. However, the program does not execute quickly. Therefore it has a bug. (use letters E, Q, B) The crop is good, but there is not enough water. If there is a lot of rain or not a lot of sun, then there is enough water. Therefore the crop is good and there is a lot of sun. (use letters C, W, R, S)

18. Section 1.2Propositional Logic17 Class Exercise Write down the propositional form of the following argument: If my client is guilty, then the knife was in the drawer. Either the knife was not in the drawer or Jason Pritchard saw the knife. If the knife was not there on October 10, it follows that Jason Pritchard didn’t see the knife. Furthermore, if the knife was there on October 10, then the knife was in the drawer and also the hammer was in the barn. But we all know that the hammer was not in the barn. Therefore, ladies and gentlemen of the jury, my client is innocent.