If T is a model complete theory with the strict order property, then the theory of the models of T with an automorphism has no model companion.

For a theory T in L, T σ is the theory of the models of T with an automorphism σ. If T is an unstable model complete theory without the independence property, then T σ has no model companion. If T is an unstable model complete theory and T σ has the amalgamation property, then T σ has no model companion. If T is model complete and has the fcp, then T σ has no model completion.

Let T be a strongly minimal theory with quantifier elimination. We show that the class of existentially closed models of T{“σ is an automorphism”} is an elementary class if and only if T has the definable multiplicity property, as long as T is a finite cover of a strongly minimal theory which does have the definable multiplicity property. We obtain cleaner results working with several automorphisms, and prove: the class of existentially closed models of T{“σi is an automorphism”: i=1,2} is (...) an elementary class if and only if T has the definable multiplicity property. (shrink)

Let L be a finite relational language and α=(αR:R ∈ L) a tuple with 0 < αR ≤1 for each R ∈ L. Consider a dimension function $ \delta _\alpha (A) = \left| A \right| - \sum\limits_{R \in L} {\alpha {\mathop{\rm Re}\nolimits} R(A)} $ where each eR(A) is the number of realizations of R in A. Let $K_\alpha $ be the class of finite structures A such that $\delta _\alpha (X) \ge 0$ 0 for any substructure X of A. We (...) show that the theory of the generic model of $K_\alpha $ is AE-axiomatizable for any α. (shrink)

We construct an ab initio generic structure for a predimension function with a positive rational coefficient less than or equal to 1 which is unsaturated and has a superstable non-ω-stable theory.

Let \ be an ab initio amalgamation class with an unbounded increasing concave function f. We show that if the predimension function has a rational coefficient and f satisfies a certain assumption then the generic structure of \ has a model complete theory.

We investigate two constants cT and rT, introduced by Chaitin and Raatikainen respectively, defined for each recursively axiomatizable consistent theory T and universal Turing machine used to determine Kolmogorov complexity. Raatikainen argued that cT does not represent the complexity of T and found that for two theories S and T, one can always find a universal Turing machine such that equation image. We prove the following are equivalent: equation image for some universal Turing machine, equation image for some universal Turing (...) machine, and T proves some Π1-sentence which S cannnot prove. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. (shrink)