Model Companions of Tσfor stable T
John Baldwin, Saharon Shelah
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
Related papers
Logarithmic--exponential preparation in sharply o-minimal structures
Gal Binyamini, Oded Carmon, Dmitry Novikov
Stoic Logic and Natural Term Logic
Clarence Lewis Protin
From raw Solvability Complexity Index proofs to Weihrauch degrees
Christopher Sorg
Existence of bases implies the axiom of choice, a foundation-free proof
Gabriel Fernandes, Renan Maneli Mezabarba, Vinicius de Oliveira Rodrigues
Every countable meet-continuous lattice is Scott sober
Xiaoquan Xu, Wei Ji
A minimal type of Morley rank ω in a partial differential field
Piotr Kowalski