1

2  6 argument forms, 15 points each, plus 10 free points  Symbolic argument forms (no translations)  For each one, you will be asked to construct a derivation of the conclusion from the premises. rule sheet  The rule sheet will be provided. 1 problemfromSet D 2 problem fromSet E 2 problemsfromSet F 1 problemfromSet G (91-96)

3   ––––  I I     ––––––      ––––––  OO  (    ) ––––––––   OO  ––––––     ––––––    II  ––––––      ––––––  OO   ––––––  &    ––––––  &  &I&I ––––––   &  ––––––  &O&O –––––  –––––  DN  (    ) ––––––––  &  OO  (  &  ) ––––––––    &O&O

4  D  :   D   As   :    CD  :    CD   As  :      DD  :  DD           ID  :  ID   As   :   

5 There are 6 kinds of formulas in Sentential Logic: For each of these, there is a suggested show-strategy. 1.atomic formulasP, Q, etc. 2.negations  3.conjunctions& 4.conditionals  5.disjunctions  6.biconditionals 

6  :     As  :  ° ° ° CD ??

7  :    As   :  ° °  DD DD

8  :    As   :  ° °  IDID DD  is atomic (P,Q,R, etc.)

9  :     [    ]As   :  ° °  IDID DD

10 &  :  &   :  ° ° °  :  ° ° ° &D ?? NEW RULE NEW STRATEGY

11 (12) (11) (10) (9) (8) (7) (6) (5) (4) (3) (2) (1) 11, R 1,9, Q & R DD  : R As P CD  : P  R 6, Q 1,4, Q & R DD  : Q As P CD  : P  Q &D  : (P  Q) & (P  R) Pr P  (Q & R) &O OO OO

12 (12) (13) (14) (15) (11) (10) (9) (8) (7) (6) (5) (4) (3) (2) (1) As Q DD  :  2,12, P 3,12,  P DD  :  Q 6,9,  3,8,  P 1,6, Q DD  :  As P DD  :  P &D  :  P &  Q Pr Q   P Pr Q  P Pr P  Q (16)14,15,  II OO OO OO OO II

13 (17) (16) (12) (13) (14) (15) (11) (10) (9) (8) (7) (6) (5) (4) (3) (2) (1) 13,16,  4,15,  P ID  :  P As P DD  :  2,13,  Q 7,10,  4,9, Q 1,7, P DD  :  As  Q ID  : Q &D  : Q &  P As P  Q CD  : (P  Q)  (Q &  P) Pr P   Q Pr P  Q II OO OO II OO OO

14