Skip to content

Model Companions of Tσfor stable T

John Baldwin, Saharon Shelah

math.LOarXiv:math/0105136

Abstract

Let T be a complete first order theory in a countable relational language L . We assume relation symbols have been added to make each formula equivalent to a predicate. Adjoin a new unary function symbol sigma to obtain the language Lsigma; Tsigma is obtained by adding axioms asserting that sigma is an L-automorphism. We provide necessary and sufficient conditions for Tsigma to have a model companion when T is stable. Namely, we introduce a new condition: Tsigma admits obstructions, and show that Tsigma has a model companion iff and only if Tsigma does not admit obstructions. This condition is weakening of the finite cover property: if a stable theory T has the finite cover property then Tsigma admits obstructions.

Create a lesson