CIS 301. Logical Foundations of Programming, Spring 2001

Assignment #4. Due date: Friday, February 16, 2001; BEFORE class. You are asked to do the following exercises:

#5 of "Exercises 1.8" on page 49 of your textbook [worth 1 point], please explain your answer;
Can there be a formula that is satisfiable such that its negation is valid? Explain your answer [worth 2 points].
#7(a) from "Exercises 1.13" on page 75, [worth 3 points];
#2 from "Exercises 1.14" on page 83, [worth 2 points];
Is the formula ((p q r) (p q) (q r) (r p) ( p q r)) satisfiable? Explain your answer [worth 2 points].

Thus, you can earn a total of ten points for completing this homework.