You are on page 1of 1

Philosophy 2211Q: Symbolic Logic - Problem Set 7

October 29, 2014

Hard copies due in class November 5th, 2014. Electronic copies due by midnight November
4th. No late submisions will be graded.

Problem 1 (50 points)


Let us impose both the exhaustion and exclusion constraints for our cases. That is, we consider classical
cases only. Prove that the following arguments are valid, or else provide a counterexample.
(i)F a, F a Gb Gb.
(ii) F a F b F c.
(iii) F a F a Gb.
(iv) F a Gb, F a Gb Gb.

Problem 2 (50 points)


Let us drop both the exhaustion and exclusion constraints for our cases. That is, we consider FDE cases.
Prove that the following arguments are valid, or else provide a counterexample.
(i)F a, F a Gb Gb.
(ii) F a F b F c.
(iii) F a F a Gb.
(iv) F a Gb, F a Gb Gb.

Bonus (10 points)


To obtain the Predicate logic version of K3 , we simply need to drop exhaustion and accept exclusion. But
how would we go about dening a Predicate Logic version of Weak Kleene? (Note: This problem is very
dicult, and will require careful consideration).

You might also like