2008/11/4 Lesson Plan

Equivalence sets are cheap to implement but not COMPLETE.  A complete method is
PARAMODULATION, a new rule of inference:

for any terms x, y, z where UNIFY(x,z) = THETA

l1 v ... lk v x=y,       m1 v ... v mn[z]
----------------------------------------------
SUBST(THETA, l1 v ... v lk v m1 v .... v mn[y])

EXAMPLE:

Henry only teaches brilliant students. 
Garrett and Adam have the same teacher. 
Henry is Garrett's teacher. 
Therefore, Adam is brilliant
(T(x) = the teacher of x; B(x) = x is brilliant)

**************************************************

Go over homework.
Go over readings for next week.

**************************************************
Godel's Incompleteness Theorem --