CSE 463/563, Spring 2005

HOMEWORK #8

Clause Form

Last Update: 25 March 2005

Note: or material is highlighted

Convert each of the following FOL wffs to clause form, as defined by the algorithm presented in lecture. For partial credit, show all your work, and justify each step using the algorithm's numbering scheme.

1. $(P \wedge Q) \vee (R \wedge S)$
2. $\exists x \forall y \exists z \exists w \forall u \forall v \exists t.P(x,y,z,w,u,v,t)$
3. $\exists x[S(x) \wedge \forall y[S(y) \supset y=x]]$
4. $\exists x \forall y [ \neg S(y,y) \supset S(x,y)]$
5. Do *NOT* attempt this one unless your mind is entirely clear and you have nothing else to do. But, if you find yourself in that situation, you might find this sort of fun to try :-)
   
   $(P \equiv Q) \equiv (\neg P \equiv \neg Q)$

DUE: AT THE BEGINNING OF LECTURE, FRIDAY, APRIL 1