In this paper, the connections between model theory and the theory of infinite permutation groups are used to study the n-existence and the n-uniqueness for n-amalgamation problems of stable theories. We show that, for any n ⩾ 2, there exists a stable theory having -existence and k-uniqueness, for every k ⩽ n, but has neither -existence nor -uniqueness. In particular, this generalizes the example, for n = 2, due to Hrushovski given in 3. © 2011 WILEY-VCH Verlag GmbH & Co. (...) KGaA, Weinheim. (shrink)

We study a class of 0-categorical simple structures such that every M in has uncomplicated forking behavior and such that definable relations in M which do not cause forking are independent in a sense that is made precise; we call structures in independent. The SU-rank of such M may be n for any natural number n>0. The most well-known unstable member of is the random graph, which has SU-rank one. The main result is that for every strongly independent structure M (...) in , if a sentence φ is true in M then φ is true in a finite substructure of M. The same conclusion holds for every structure in with SU-rank one; so in this case the word ‘strongly’ can be removed. A probability theoretic argument is involved and it requires sufficient independence between relations which do not cause forking. A stable structure M belongs to if and only if it is 0-categorical, 0-stable and every definable strictly minimal subset of is indiscernible. (shrink)

In this paper, we continue the construction done in [3], so that under model-4-CA or 4-CA, given a bounded quadrangle C induced from a group configuration, we build a canonical hyperdefinable homogeneous space equivalent to C. When C is principal, we can choose the homogeneous space principal as well.

We study generalized amalgamation properties in simple theories. We formulate a notion of generalized amalgamation in such a way so that the properties are preserved when we pass from T to Teq or Theq; we provide several equivalent ways of formulating the notion of generalized amalgamation.We define two distinct hierarchies of simple theories characterized by their amalgamation properties; examples are given to show the difference between the hierarchies.

We show that in a stable first-order theory, the failure of higher dimensional type amalgamation can always be witnessed by algebraic structures that we call n-ary polygroupoids. This generalizes a result of Hrushovski in [16] that failures of 4-amalgamation are witnessed by definable groupoids. The n-ary polygroupoids are definable in a mild expansion of the language.

Building on Hrushovski's work in [5], we study definable groupoids in stable theories and their relationship with 3-uniqueness and finite internal covers. We introduce the notion of retractability of a definable groupoid (which is slightly stronger than Hrushovski's notion of eliminability), give some criteria for when groupoids are retractable, and show how retractability relates to both 3-uniqueness and the splitness of finite internal covers. One application we give is a new direct method of constructing non-eliminable groupoids from witnesses to the (...) failure of 3-uniqueness. Another application is a proof that any finite internal cover of a stable theory with a centerless liaison groupoid is almost split. (shrink)

Nous isolons des propriétés valables dans certaines théories de purs corps ou de corps munis d’opérateurs afin de montrer qu’une théorie est simple lorsque les clôtures définissables et algébriques sont contrôlées par une théorie stable associée.