(i) This document provides the details of Problem Set 7 for the course Philosophy 2211Q: Symbolic Logic. It includes instructions for submitting the problem set and outlines 3 problems to solve involving propositional and predicate logic arguments. (ii) Problem 1 (50 points) asks students to prove the validity or provide counterexamples for 4 propositional logic arguments under classical assumptions of exhaustion and exclusion. Problem 2 (50 points) repeats the 4 arguments but requires solutions under free default assumptions, dropping exhaustion. (iii) A bonus problem (10 points) asks students to define a predicate logic version of Weak Kleene three-valued logic.
(i) This document provides the details of Problem Set 7 for the course Philosophy 2211Q: Symbolic Logic. It includes instructions for submitting the problem set and outlines 3 problems to solve involving propositional and predicate logic arguments. (ii) Problem 1 (50 points) asks students to prove the validity or provide counterexamples for 4 propositional logic arguments under classical assumptions of exhaustion and exclusion. Problem 2 (50 points) repeats the 4 arguments but requires solutions under free default assumptions, dropping exhaustion. (iii) A bonus problem (10 points) asks students to define a predicate logic version of Weak Kleene three-valued logic.
(i) This document provides the details of Problem Set 7 for the course Philosophy 2211Q: Symbolic Logic. It includes instructions for submitting the problem set and outlines 3 problems to solve involving propositional and predicate logic arguments. (ii) Problem 1 (50 points) asks students to prove the validity or provide counterexamples for 4 propositional logic arguments under classical assumptions of exhaustion and exclusion. Problem 2 (50 points) repeats the 4 arguments but requires solutions under free default assumptions, dropping exhaustion. (iii) A bonus problem (10 points) asks students to define a predicate logic version of Weak Kleene three-valued logic.
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).