A Definability Theorem for First Order Logic

Carsten Butz
Ieke Moerdijk

March 1997


For any first order theory T we construct a Boolean valued model M, in which precisely the T-provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order formula

Available as PostScript, PDF, DVI.


Last modified: 2003-06-08 by webmaster.