truth tables

PHIL 110 – San Francisco State University

Midterm Exam, Part 2

Name: Type name here


Instructions: download this document to a location easily accessible on your computer or the cloud. Complete sections 1 and 2 and upload this document to iLearn by 11:55pm on Sunday, April 2nd. Microsoft Word or Adobe PDF files are acceptable file formats. No late submissions will be accepted.


1 Truth Tables for Arguments (1 point each)


Use truth tables to determine if the arguments in 1-5 are either valid or invalid. Please use the inserted tables below to complete the truth tables. If the argument is invalid, please identify the row that violates the validity definition (e.g., “Invalid, 2nd row”).


1. 1. S  L

2. L S

3. S   L




2. 1. H  G

2. (G H) (H G)

3. G • H


(G

H)

(H

G)



3. 1. P  J

2. (J • P)

3. J   P

(J

P)

4. 1. (B  T) • (B  N)

2. B B

3. T  N


(B

T)

(

N)




5. 1. P  Q

2. P Q

3. Q





2 Natural Deduction Proofs (1 point each)

6-10 are each valid arguments. Demonstrate the validity of each argument using a natural deduction proof and MP, MT, DS, and HS.

Copy and paste symbols into your proof where necessary:


 v 

*Note that the justification in the proofs below may differ from your own depending on (1) the argument forms you utilized, and (2) the order in which they were utilized.

(6) 1.  A  (B   C)

2.  D  (C  A)

3. D v A

4. D /B

(7) 1. G  [G v (S  G)]

2. (S v L)  G

3. S v L / L

(8) 1. H  [E  (C  D)]

2. D  E

3. E v H

4. E / C

(9) 1. B  [(A  K)  (B  K)]

2. J  K

3. A  J

4. B / A

(10) 1. (C  M)  (N  P)

2. (C  N)  (N  M)

3. (C  P)  M

4. C N / C