PHIL 250: Introduction to Symbolic Logic

tennant.9@osu.edu

---

Spring 1998

---

---

Prove the following arguments, using only the introduction rules and the
elimination rules for the logical operators.

---

A->B
______			Solution to problem 1

~B->~A


A->B
____________	      Solution to problem 2

(A&C)->(BvD)


A->B		
A->C
________	      Solution to problem 3

A->(B&C)


A->C		
B->C
________	      Solution to problem 4

(AvB)->C


A->C		
B->D
____________	      Solution to problem 5

(AvB)->(CvD)


(A&B)->C
_________	      Solution to problem 6

A->(B->C)


A->(B->C)
_________	      Solution to problem 7

(A&B)->C


A->(BvC)	
B->D		
C->D
_____			Solution to problem 8

A->D


~(AvB)
______			Solution to problem 9

~A&~B


A->(B&C)	
_____________	      Solution to problem 10

(A->B)&(A->C)