2. Formal Proofs and Boolean Logic Chapter 6 Language, Proof and Logic

3. Conjunction rules 6.1  Elim: P 1  …  P i  …  P n … P i  Intro: P 1  P n … P 1  …  P n 1.A  B  C 2.B  Elim: 1 3.C  Elim: 1 4.C  B  Intro: 3,2

4. Disjunction rules 6.2a  Intro: P i … P 1  …  P i  …  P n  Elim: P 1  …  P n …  … S P1…SP1…S Pn…SPn…S

5. Example 6.2b 1. (A  B)  (C  D) 2. A  B 3. B  Elim: 2 4. B  D  Intro: 3 5. C  D 6. D  Elim: 5 7. B  D  Intro: 6 8. B  D  Elim: 1, 2-4, 5-7 You try it, page 152

6. Contradiction and negation rules 6.3  Elim:  … P  Intro: P …  P …   Elim:  P … P  Intro: P …   P You try it, p.163

7. The proper use of subproofs 6.4 A subproof may use any of its own assumptions and derived sentences, as well as those of its parent (or grandparent, etc.) proof. However, once a subproof ends, its statements are discharged. That is, nothing outside that subproof (say, in its parent or sibling proof) can cite anything from within that subproof.

8. Strategy and tactics 6.5 When looking for a proof, the following would help: 1.Understand what the sentences are saying. 2.Decide whether you think the conclusion follows from the premises. 3.If you think it does not follow, look for a counterexample. 4.If you think it does follow, try to give an informal proof first, and then turn it into a formal one. 5. Working backwards is always a good idea. 6. When working backwards, though, always check that your intermediate goals are consequences of the available information. You try it, page 170.

9. Proofs without premises 6.6 The conclusion of such a proof is always logically valid! 1. P  P 2. P  Elim: 1 3.  P  Elim: 1 4.   Intro: 2,3 5.  (P  P)  Intro: 1-4