The category of definable sets and definable functions for a fixed language (or more generally, for an -theory ) does not have finite colimits. Given a 1-st order language , and a theory in , we say that admits/has elimination of imaginaries if it one can take the quotients of definable sets by equivalence relations.
Bruno Poizat, Une théorie de Galois imaginaire, J. Symbolic Logic 48 (1984), no.4, 1151-1170, MR85e:03083, doi
D. Haskell, E. Hrushovski, H.D.Macpherson, Definable sets in algebraically closed valued fields: elimination of imaginaries, J. reine und angewandte Mathematik 597 (2006)
Saharon Shelah, Classification theory and the number of non-isomorphic models, Studies in Logic and the Foundations of Mathematics 92, North Holland, Amsterdam 1978
Revised on May 31, 2012 17:47:04
by Zoran Škoda
(193.51.104.33)