Difficult Practice Proofs
You should be able to do all of S77-S100, as well as the homework
problems assigned for 5/4/99. For some difficult practice proofs
try the following:
1. @x$y(Fx -> Gy)|-$y@x(Fx -> Gy)
2. @x(Fx <-> Gx v Hx), $xGx, @x(Fx -> @yHy) |- @xFx
3. Ha & $x~Fx, $xGx -> @xFx, @x(Hx -> Jx) |- $x(~Gx & Jx)
4. $x(Px v Qx), @x(Px -> Kx), @x(Qx -> Kx)|-$xKx
5. $x(Fx & Hx) v @x(Jx -> Gx), @x(Fx -> ~Hx) |- $xJx -> $x(Gx
& Jx)
6. $x(Fx v Gx), $xFx -> @xHx, $xGx -> ~$xHx |- ~($xHx & $x~Hx)
7. @xFx v $xGx |- $x(Fx v Gx)
Indirect Truth Table Practice.
3 of the following 5 sequents are valid.
1. ~(P <-> Q), P v (R v S) |- ~R & Q -> S
2. P v Q -> R, R & S <-> ~Q, S & P |- Q &
R
3. P v R -> Q, ~(R <-> S), R -> ~Q |- P -> S
4. ~(P v Q), R -> S, ~S v Q |- Q <-> R
5. P -> ~R, Q & R <-> S |- P <-> ~S
Some Interesting Symbolizations to Think About
For more predicate logic symbolization practice, try the following worksheets: