Definability and automorphisms in abstract logics

Abstract.In any model theoretic logic, Beth’s definability property together with Feferman-Vaught’s uniform reduction property for pairs imply recursive compactness, and the existence of models with infinitely many automorphisms for sentences having infinite models. The stronger Craig’s interpolation property plus the uniform reduction property for pairs yield a recursive version of Ehrenfeucht-Mostowski’s theorem. Adding compactness, we obtain the full version of this theorem. Various combinations of definability and uniform reduction relative to other logics yield corresponding results on the existence of non-rigid models.