Geodesic
Note on a theorem of Putnam's
Theory and applications of categories, Tome 3 (1997), pp. .45-49 http://www.

Voir la notice de l'article provenant de la source Theory and Applications of Categories website

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.
Classification : 03C52, 18B99.
Keywords: model, relational theory, back and forth lemma. 
@article{TAC_1997_3_a2,
     author = {Michael Barr},
     title = {Note on a  theorem of {Putnam's}},
     journal = {Theory and applications of categories},
     pages = {.45--49
http://www},
     publisher = {mathdoc},
     volume = {3},
     year = {1997},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/TAC_1997_3_a2/}
}
TY  - JOUR
AU  - Michael Barr
TI  - Note on a  theorem of Putnam's
JO  - Theory and applications of categories
PY  - 1997
SP  - .45
EP  - 49
http://www
VL  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TAC_1997_3_a2/
LA  - en
ID  - TAC_1997_3_a2
ER  - 
%0 Journal Article
%A Michael Barr
%T Note on a  theorem of Putnam's
%J Theory and applications of categories
%D 1997
%P .45-49
http://www
%V 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TAC_1997_3_a2/
%G en
%F TAC_1997_3_a2
Michael Barr. Note on a  theorem of Putnam's. Theory and applications of categories, Tome 3 (1997), pp. .45-49
http://www. http://geodesic.mathdoc.fr/item/TAC_1997_3_a2/