# (First order predicate calculus) Show that the theory of the equality axioms isn’t complete

If I have a theory with the following axioms:

1. $\forall x.(x=x)$

2. $\forall x\forall y.\left(x=y\rightarrow\left(\varphi\left(x,x\right)\rightarrow\varphi\left(x,y\right)\right)\right)$, where $\varphi$ is any atomic formula.

And any model of these axioms is an equivalence relation, how do I prove that this theory isn't complete?

-
What is the signature of your model? if it is just "=" as a binary relation, then φ(x,y) (being atomic) can only be x=y, it seems to me. If you allow φ to be any (also non atomic) formula, then your signature has infinite binary relations. Also: the sentence "And any model of these axioms is an equivalence relation" simply means that the "=" theory also has the axioms of an equivalence theory (for ex. x=y and y=z → x=z). Am I correct? – magma Dec 19 '11 at 9:21
I would like to edit my previous comment, but i do not see how.So - in my previous comment - please replace the sentence:"if you allow...." with "If you alllow φ to be any other binary relation (that is different from "=") , then your signature has infinite binary relations, so it is in fact a scheme". – magma Dec 19 '11 at 13:41

Let $\phi$ be the sentence $\forall x \forall y (x=y)$. Is $\phi$ a theorem? Is $\lnot\phi$ a theorem?
It is incomplete. The obvious argument is model-theoretic. There is a model with more than $1$ element. So $\phi$ cannot be a theorem. there is a model with $1$ element. So $\lnot\phi$ cannot be a theorem. – André Nicolas Dec 19 '11 at 10:13