SD : Natural Deduction In S

1. SD: Natural Deduction In S

2. Valid or Not? • If Carol drives, Ann will go to the fair • Carol will drive, if Bob goes and pays for gas • Bob will pay for gas, if Ann promises to pay him back • If Bob lets Ann ride shotgun, she will promise to pay him back • Bob goes to the fair and lets Ann ride shotgun So, Ann goes to the fair

3. Deducing the Conclusion • If Carol drives, Ann will go to the fair • Carol will drive, if Bob goes and pays for gas • Bob will pay for gas if Ann promises to pay him back • If Bob lets Ann ride shotgun, she will promise to pay him back • Bob goes to the fair and lets Ann ride shotgun • Bob lets Ann ride shotgun from 5 • Ann promises to pay Bob back from 4,6 • Bob pays for gas from 3,7 • Bob goes to the fair from 5 • Bob goes and pays for gas from 8,9 • Carol drives from 2,10 • Ann goes to the fair from 1,11

4. Symbolically Deriving the Conclusion • If Carol drives, Ann will go to the fair • Carol will drive, if Bob goes and pays for gas • Bob will pay for gas if Ann promises to pay him back • If Bob lets Ann ride shotgun, she will promise to pay him back • Bob goes to the fair and lets Ann ride shotgun • Bob lets Ann ride shotgun from 5 • Ann promises to pay Bob back from 4,6 • Bob pays for gas from 3,7 • Bob goes to the fair from 5 • Bob goes and pays for gas from 8,9 • Carol drives from 2,10 • Ann goes to the fair from 1,11

5. Reiteration • You may reiterate any wff on some later line • The line number of the reiterated wff appears in the justification • Remember that the metavariables represent wffs of arbitrary complexity—the reiterated wff need not be atomic • Usually only useful in certain special circumstances • The same input lines may be used repeatedly

6. You may form the conjunction of any two previous wffs Order of input wffs is irrelevant The line numbers of the two input wffs are cited in the justification Remember that the metavariables represent wffs of arbitrary complexity—the input wffs need not be atomic The same input lines may be used repeatedly You may derive either conjunct of an exiting conjunction The line number of the conjunction is cited in the justification Again, remember that the metavariables indicate wffs of arbitrary complexity The same input lines may be used repeatedly Wedge Intro & Elim

7. From a conditional and a wff exactly matching the antecedent, you may derive the consequent Order of input wffs is irrelevant The line numbers of the two input wffs are cited in the justification Arrow Intro & Elim • Having started a subderivation with the auxiliary assumption P, and derived Q, you may end the subderivation and derive the conditional P!Q • Once the subderivation is closed, wffs inside it are inaccessible • The whole subderivation is cited in the justification

8. Valid? • If Bob goes to the fair, then he’ll eat lots of popcorn • If Bob eats lots of popcorn, then if he rides the roller coaster he’ll throw up If Bob goes to the fair and rides the roller coaster, then he’ll throw up

9. Deducing the Conclusion • If Bob goes to the fair, then he’ll eat lots of popcorn • If Bob eats lots of popcorn, then if he rides the roller coaster he’ll throw up • Suppose Bob goes to the fair and rides the roller coaster assumption • Bob goes to the fair from 3 • Bob eats lots of popcorn from 1,4 • If Bob rides the roller coaster he’ll throw up from 2,5 • Bob rides the roller coaster from 3 • Bob throws up from 6,7 • If Bob goes to the fair and rides the roller coaster, then he’ll throw up from 3-8

10. Symbolically Deriving the Conclusion • If Bob goes to the fair, then he’ll eat lots of popcorn • If Bob eats lots of popcorn, then if he rides the roller coaster he’ll throw up • Suppose Bob goes to the fair and rides the roller coaster assumption • Bob goes to the fair from 3 • Bob eats lots of popcorn from 1,4 • If Bob rides the roller coaster he’ll throw up from 2,5 • Bob rides the roller coaster from 3 • Bob throws up from 6,7 • If Bob goes to the fair and rides the roller coaster, then he’ll throw up from 3-8

11. Anatomy of a Derivation Every derivation has a Main Scope Line Primary Assumptions indicated with a ‘P’ Goal wff indicated by a ‘`’ Most derivations we’ll do will have primary assumptions attached to the main scope line by a Horizontal Auxiliary Assumptions indicated with an ‘A’ If a subderivation appears, it will have its own scope line and horizontal, any wff right of this line depends on the aux assumption—a subderivation only ever has one assumption Justification for each step after the primary assumptions is listed to the right, with the proper citations of input line(s) and rule abbreviation The fact that the goal sentence is on the main scope line shows that it has been derived from the primary assumptions This derivation is not as short as it could be—though not required, shorter derivations are better Note that input lines may be used repeatedly

12. Hook Intro & Elim • Having started a subderivation with the auxiliary assumption P (:P) and derived both Q and :Q (a contradiction), you may end the subderivation and derive :P (P) • Note that neither the P nor the Q need be atomic • In some cases P may be the same wff as Q

13. Valid? • If Bob goes to the fair, then Carol won’t • If Ann goes to the fair then Bob will • Carol will go to the fair only if Ann does Carol does not go to the fair

14. Deducing the Conclusion • If Bob goes to the fair, then Carol won’t • If Ann goes to the fair then Bob will • Carol will go to the fair only if Ann does • Suppose Carol does go assumption • Ann goes to the fair from 3,4 • Bob goes to the fair from 2,5 • Carol won’t go from 1,6 (Carol both goes and doesn’t go from 4,7) • So Carol doesn’t go to the fair from 4-7

15. Any wff may be attached to an existing one with the vee This simple rule is often overlooked Having shown that each side of a disjunction leads to the same result, you may derive that result You must cite 3 things: the disjunction and two subderivations Vee Intro & Elim

16. Valid? • If either Ann or Bob goes to the fair, then Carol will go • Ann goes Carol goes to the fair

17. Deducing the Conclusion • If either Ann or Bob goes to the fair, then Carol will go • Ann goes • Either Ann or Bob goes from 2 • Carol goes to the fair from 1,3

18. Valid? • If Carol goes to the fair, then Ann will drive • If Bob goes to the fair, then he will pay for gas • If Bob pays for gas, then Ann will drive • Either Carol or Bob goes to the fair Ann will drive

19. Deducing the Conclusion • If Carol goes to the fair, then Ann will drive • If Bob goes to the fair, then he will pay for gas • If Bob pays for gas, then Ann will drive • Either Carol or Bob goes to the fair • Suppose Carol goes assn. • Ann will drive from 1,5 • Suppose Bob goes assn. • Bob will pay for gas from 2,7 • Ann will drive from 3,8 • Ann will drive 4,5-6,7-9

20. Essentially you are just doing two !I Both Subderivations must be cited A biconditional wff and one side of it allow you to derive the other side This is much like !E, but here you may go in either direction Double Arrow Intro & Elim

21. Proof Theory in SD Derivation in SD:A derivation inSD is a finite sequence of wffs of S such that each wff is either an assumption with scope indicated or justified by one of the rules of SD. Derivable inSD, G`P:A wff P of S is derivable inSD from a set G of wffs of S iff there is a derivation in SD the primary assumptionsof which are members of Gand P depends on only those assumptions. GP P is derivable from G, G syntactically entails P ?P or P P is derivable from the empty set, P is a theorem GP P is not derivable from G…

22. Validity, Theoremhood in SD Valid inSD: An argument of S is valid in SD iff the conclusion is derivable in SD from the set consisting of only the premises, otherwise it is invalid in SD. Theorem ofSD: A wff P is a theorem ofSD iff P is derivable in SD from the empty set; i.e., iff P.

23. Equivalence and Inconsistency in SD Equivalent in SD:Two wffs P and Q are equivalent in SD iff they are interderivablein SD; i.e., iff both PQ and QP. Inconsistent in SD:A set  of wffsis inconsistent inSD iff, for some wff P, both P and :P.

25. Proof Theory Summary Derivable inSD, P:A wff P of S is derivable inSD from a set  of wffs of S iff there is a derivation in SD the primary assumptions of which are members of  and P depends on only those assumptions. Valid inSD:An argument of S is valid in SD iff the conclusion is derivable in SD from the set consisting of only the premises, otherwise it is invalid in SD. Theorem ofSD:A wff P is a theorem ofSD iff P is derivable in SD from the empty set; i.e., iff P. Equivalent in SD:Two wffs P and Q are equivalent in SD iff they are interderivablein SD; i.e., iff both PQ and QP. Inconsistent in SD:A set  of wffsis inconsistent inSD iff, for some wff P, both P and :P (this can be shown using a single derivation).

26. SDE—An Extension to SD The rules of SD, plus the following Inference Rules…

27. …plus the following Substitution Rules.

28. Inference Rules vs. Substitution Rules: Two important Differences • Substitution rules are bidirectional, whereas inference rules are unidirectional. • Whereas inference rules require that the wff on a given line (i.e., the whole wff) match the form in the rule, substitution rules require only that some well-formed component of a wff on a given line match the form in the rule. That is, whereas inference rules work only on whole lines, substitution rules work on whole lines or well-formed subcomponents.