MORE PREDICATE LOGIC DERIVATIONS FOR UNIT 6

TRY A GOOD NUMBER FROM EACH SECTION

Construct derivations to validate each of the following arguments.
One-Place Predicates:
1.

x(Gx ~Hx). x(Hx ~Bx).

x(Gx y(Gy By)

2.

xAx xGx. y(Jy Hy). ~x(~Jx Cx) xFxx(Gx ~Hx) x(Ax Fx)

3.

xGx. x(Gx ~Dx). ~yDy x(~Cx Ax) y(~Ay Cy)

4.

x(Bx Cx). x(Fx Hx).

5.

(x(Ax ~Bx) x(Bx ~Aa)) x~(Ax Cx)

6.

x(Ax Bx). y(Gy Hy). xAx y(By ~Hy) ~xGx xy(~Hx Hy)

7.

x(Ax (y(ByCy) Dx)). x(Dx (z(BzEz) Fx)).

xFx x~Cx. ~zHz xBx

y(By (Cy Ey)) x(Ax Fx)

8.

x(Fx y(Gy Hx)) ~xAx x(Fx zGz) x(Cx ~Ax)

9.

xBa(b(x)) (xFx Ga(e)). x(Ba(x) Ca(x)). x(~Gx ~yFy) zGa(z).

10. x~(Fx ~Gx) x~Hx xy~(Fy ~Gx) ~yHy

Try some of these using ONLY the basic rules (S, ADJ, ADD, MTP, MP, MT, BC, CB, DN, EG, EI, UI).
11. xBx. x(~Bx Cx). y((Ay ~Dy) ~Cy). xDx y~Ay.
12. (~Ba Ga) (x~(Cx Gx) x(Cx ~Bx))
13. y(By ~(Dy Ey)). x(Dx ~(Fx ~Cx)).

x(Ex Fx). x(~Bx Cx)

14. x(~Bx Cx). Ba y~(By Cy) x(~Cx Bx)

15. y(By Fy Cy). xFx x(Bx Ax). Fb. x(~Ax Bx) Cb
16. x(~Cx (Aa ~Fx)).

x(~Fx (~Cx Ax)) x(Ax Fx)

17. A(ab) B(ba). xy(B(xy) C(yx)). wz(C(wz) A(wz)). x~(G(xx) C(xb)).

~xy(A(xy) G(xx))
18. xy~(B(xy) F(yx)). xy(Gx B(xy)). xy(F(xy) H(yy)). x(~Gx H(xx))
1
PHL 245: Derivations for Unit 6

Multi-Place Predicates
19. xyz(F(xy) F(yz) F(xz)). ~xy~F(xy). xy(F(xy) F(yx)) xF(xx)
20. xy~(G(xy) H(xy)) x(~yG(xy) ~yH(xy))
21. x(Ax yL(xy)). y((Cy L(yy)) ~By). x(Ax Bx) xL(xx)
22. xy(Gx L(xy)). z(~Fz Gz). x(Cx ~yL(yx)). x(Fx y(Cy L(xy)))
23. xy(B(xy) A(yx)). xy(Fy B(yx)). x(Fx Hx) x(Fx Hx). x(Gx y(A(xy) Hy))
24. xyz(A(xz) ~B(zy)) x(~A(xx) B(xx))
25. xy(L(yx) zB(xyz). y(xB(xyy) zH(yz)). yxH(xy) ~xyG(xy).
~xy(L(xy) G(yx))
26. xy(Hx L(xy)).

x(Gx yL(yx)).

yx (Gx Hy L(xy) L(yx)) ~z(Fz Gz).

x(Fz ~Gz)
27. x(Ax yH(xy)). x(Ax Fx). xFx yz(By H(zz) G(yz)).
x(Bx y(Fy G(xy)))
28. x(Ax y(Gy F(xy))) xC(xa). x(~Ax Bx). x(Bx Gx).
yz(Gy F(zy)) xC(xx)
29. xyL(xy) xyz(L(xy) L(yz) L(xz)). xy(L(xy) ~L(yx)) ~xL(xx)
30. xy(Ax By). x(Ax Bx) xyH(a(x)y). xH(xx)
31. xy(FxzG(zy)) xyzH(xyz). xy(H(xyy) z~B(xz)). x( zFz G(bx)) ~yB(yy)
32. xyz(B(xyz) C(yzx)). xyzC(xyz) xyL(a(x)y) xyzB(xyz) xL(xL(xa(x))
33. xy~(Fx Gy). x(Fx Gx) xyzL(xyz) xyL(xyy)
34. xyz(B(xyz) G(xy) ~G(yz)).

xyz(G(xy) ~ G(zx) H(yz))

xyzB(xyz) x(H(xx) ~G(xx))

35. xy~(Fy zG(zx)) yx~(~G(yx) Fx)
36.

xyz(A(a(x)y) B(b(y)z)). xy(A(xx) B(yy) C(xy)). xyC(xy)

37. xyL(b(x)yb(y)) xL(xxb(x))

38. xI(a(x)x). xyz(I(xy) I(yz) I(xz)). xI(a(a(a(x)))a(x))

2
PHL 245: Derivations for Unit 6

There are lots of theorems for Predicate Logic listed in the text and on Logic 2010.
(Remember, there are an infinite number of theorems!)
203-206 are the theorems for Quantifier Negation. (DONT USE QN TO DERIVE THESE!)
221 and 221 are theorems for containment (259 and 261 also involve containment.)
242 and 243 are theorems for the equivalencies between not all/some not and none/all not.
Make sure you try these and at least some others from 201-248 (one-place predicates) and some others
from 249-272 (multi-place predicates).
T203

~xFx x~Fx

T204

~xFx x~Fx

T205

xFx ~x~Fx

T206

xFx ~x~Fx

T221

x(Fx P) (xFx P)

T222

x(Fx P) ( xFx P)

T242

~x(Fx Gx) x(Fx ~Gx)

T243

~x(Fx Gx) x(Fx ~Gx)

3
PHL 245: Derivations for Unit 6