In a 1981 book, H. Putnam claimed that in a pure relational language without equality, for any model of a relation that was neither empty nor full, there was another model that satisfies the same first order sentences. Ed Keenan observed that this was false for finite models since equality is a definable predicate in such cases. This note shows that Putnam's claim is true for infinite models, although it requires a more sophisticated proof than the one outlined by Putnam.
Keywords: model, relational theory, back and forth lemma.
1991 MSC: 03C52, 18B99.
Theory and Applications of Categories, Vol. 3, 1997, No. 3, pp .45-49
http://www.tac.mta.ca/tac/volumes/1997/n3/n3.dvi
http://www.tac.mta.ca/tac/volumes/1997/n3/n3.ps
http://www.tac.mta.ca/tac/volumes/1997/n3/n3.pdf
ftp://ftp.tac.mta.ca/pub/tac/html/volumes/1997/n3/n3.dvi
ftp://ftp.tac.mta.ca/pub/tac/html/volumes/1997/n3/n3.ps