The notion of a strongly determined type over A extending p is introduced, where p .S. A strongly determined extension of p over A assigns, for any model M )- A, a type q S extending p such that, if realises q, then any elementary partial map M → M which fixes acleq pointwise is elementary over . This gives a crude notion of independence which arises very frequently. Examples are provided of many different kinds of theories with strongly determined (...) types, and some without. We investigate a notion of multiplicity for strongly determined types with applications to ‘involved’ finite simple groups, and an analogue of the Finite Equivalence Relation Theorem. Lifting of strongly determined types to covers of a structure is discussed, and an application to finite covers is given. (shrink)

A partial map f of a structure M is called almost total if |M — dom| = |M — ran| < ω. We study a difference between an almost total elementary map and an automorphism.

We study the expansion of stable structures by adding predicates for arbitrary subsets. Generalizing work of Poizat-Bouscaren on the one hand and Baldwin-Benedikt-Casanovas-Ziegler on the other we provide a sufficient condition (Theorem 4.7) for such an expansion to be stable. This generalization weakens the original definitions in two ways: dealing with arbitrary subsets rather than just submodels and removing the 'small' or 'belles paires' hypothesis. We use this generalization to characterize in terms of pairs, the 'triviality' of the geometry on (...) a strongly minimal set (Theorem 2.5). Call a set A benign if any type over A in the expanded language is determined by its restriction to the base language. We characterize the notion of benign as a kind of local homogenity (Theorem 1.7). Answering a question of [8] we characterize the property that M has the finite cover property over A (Theorem 3.9). (shrink)

§1. Introduction. In this report we wish to describe recent work on a class of first order theories first introduced by Shelah in [32], the simple theories. Major progress was made in the first author's doctoral thesis [17]. We will give a survey of this, as well as further works by the authors and others.The class of simple theories includes stable theories, but also many more, such as the theory of the random graph. Moreover, many of the theories of particular (...) algebraic structures which have been studied recently turn out to be simple. The interest is basically that a large amount of the machinery of stability theory, invented by Shelah, is valid in the broader class of simple theories. Stable theories will be defined formally in the next section. An exhaustive study of them is carried out in [33]. Without trying to read Shelah's mind, we feel comfortable in saying that the importance of stability for Shelah lay partly in the fact that an unstable theory T has 2λ many models in any cardinal λ ≥ ω1 + |T|. (shrink)

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.

An infinite structure is said to be minimal if each of its definable subset is finite or cofinite. Modifying Hrushovski's method we construct minimal, non strongly minimal structures with arbitrary finite dimensions. This answers negatively to a problem posed by B. I Zilber.

We consider the question of when, given a subset A of M, the setwise stabilizer of the group of automorphisms induces a closed subgroup on Sym(A). We define s-homogeneity to be the analogue of homogeneity relative to strong embeddings and show that any subset of a countable, s-homogeneous, ω-stable structure induces a closed subgroup and contrast this with a number of negative results. We also show that for ω-stable structures s-homogeneity is preserved under naming countably many constants, but under slightly (...) weaker conditions it can be lost by naming a single point. (shrink)

We examine two-cardinal problems for the class of O-minimal theories. We prove that an O-minimal theory which admits some (κ, λ) must admit every (κ , λ ). We also prove that every “reasonable” variant of Chang’s Conjecture is true for O-minimal structures. Finally, we generalize these results from the two-cardinal case to the δ-cardinal case for arbitrary ordinals δ.

In this paper the following theorem is proved regarding groups of finite Morley rank which are perfect central extensions of quasisimple algebraic groups.Theorem1.Let G be a perfect group of finite Morley rank and let C0be a definable central subgroup of G such that G/C0is a universal linear algebraic group over an algebraically closed field; that is G is a perfect central extension of finite Morley rank of a universal linear algebraic group. Then C0= 1.Contrary to an impression which exists in (...) some circles, the center of the universal extension of a simple algebraic group, as an abstract group, is not finite in general. Thus the finite Morley rank assumption cannot be omitted.Corollary1.Let G be a perfect group of finite Morley rank such that G/Z(G) is a quasisimple algebraic group. Then G is an algebraic group. In particular, Z(G) is finite([4],Section27.5).An understanding of central extensions of quasisimple linear algebraic groups which are groups of finite Morley rank is necessary for the classification oftamesimpleK*-groupsof finite Morley rank, which constitutes an approach to the Cherlin-Zil’ber conjecture. For this reason the theorem above and its corollary were proven in [1] (Theorems 4.1 and 4.2) under the assumption oftameness, which simplifies the argument considerably. The result of the present paper shows that this assumption can be dropped. The main line of argument is parallel to that in [1]; the absence of the tameness assumption will be countered by a model-theoretic result and results fromK-theory. The model-theoretic result places limitations on definability in stable fields, and may possibly be relevant to eliminating certain other uses of tameness. (shrink)

The new result of this paper is that for θ-stable we have S1[θ] = D[θ, L, ∞]. S1 is Hrushovski's rank. This is an improvement of a result of Kim and Pillay, who for simple theories under the assumption that either of the ranks be finite obtained the same identity. Only the first equality is new, the second equality is a result of Shelah from the seventies. We derive it by studying localizations of several rank functions, we get the followingMain (...) Theorem. Suppose that μ is regular satisfying μ ≥ |T|+, p is a finite type, and Δ is a set of formulas closed under Boolean operations. If either R[p, Δ, μ+] < ∞ or p is Δ-stable and μ satisfies “for every sequence {μi : i < |Δ| + ℵ0} of cardinals μi < μ we have that equation image holds”, then S[p, Δ, μ+] = D[p, Δ, μ+] = R[p, Δ, μ+].The S rank above is a localized version of Hrushovski's S1 rank. This rank, as well as our systematic use of local stability, allows us to get a more conceptual proof of the equality of D and R, which is an old result of Shelah. A particular case of the theorem offers a new sufficient condition for the equality of S1 and D[·, L, ∞]. We also manage, due to a more general approach, to avoid some combinatorial difficulties present in Shelah's original exposition. (shrink)

A structure (M, $ ,...) is called quasi-o-minimal if in any structure elementarily equivalent to it the definable subsets are exactly the Boolean combinations of 0-definable subsets and intervals. We give a series of natural examples of quasi-o-minimal structures which are not o-minimal; one of them is the ordered group of integers. We develop a technique to investigate quasi-o-minimality and use it to study quasi-o-minimal ordered groups (possibly with extra structure). Main results: any quasi-o-minimal ordered group is abelian; any quasi-o-minimal (...) ordered ring is a real closed field, or has zero multiplication; every quasi-o-minimal divisible ordered group is o-minimal; every quasi-o-minimal archimedian densely ordered group is divisible. We show that a counterpart of quasi-o-minimality in stability theory is the notion of theory of U-rank 1. (shrink)

In the early eighties, answering a question of A. Macintyre, J. H. Schmerl ([13]) proved that every countable recursively saturated structure, equipped with a function β encoding the finite functions, is the β-closure of an infinite indiscernible sequence. This result implies that every countably saturated structure, in a countable but not necessarily recursive language, is an Ehrenfeucht-Mostowski model, by which we mean that the structure expands, in a countable language, to the Skolem hull of an infinite indiscernible sequence (in the (...) new language). More recently, D. Lascar ([5]) showed that the saturated model of cardinality ℵ 1 of an ω-stable theory is also an Ehrenfeucht-Mostowski model. These results naturally raise the following problem: which (countable) complete theories have an uncountably saturated Ehrenfeucht-Mostowski model. We study a generalization of this question. Namely, we call ACI-model a structure which can be expanded, in a countable language L', to the algebraic closure (in L') of an infinite indiscernible sequence (in L'). And we try to characterize the λ-saturated structures which are ACI-models. The main results are the following. First it is enough to restrict ourselves to ℵ 1 -saturated structures: if T has an ℵ 1 -saturated ACI-model then, for every infinite λ, T has a λ-saturated ACI-model. We obtain a complete answer in the case of stable theories: if T is stable then the three following properties are equivalent: (a) T is ω-stable, (b) T has a ℵ 1 saturated ACI-model, (c) every saturated model of T is an Ehrenfeucht-Mostowski model. The unstable case is more complicated, however we show that if T has an ℵ 1 -saturated ACI-model then T doesn't have the independence property. (shrink)

In his thesis 'Para uma Teoria Geral dos Homomorfismos' (1944) the Portuguese mathematician José Sebastião e Silva constructed an abstract or generalized Galois theory, that is intimately linked to F. Klein’s Erlangen Program and that foreshadows some notions and results of today’s model theory; an analogous theory was independently worked out by M. Krasner in 1938. In this paper, we present a version of the theory making use of tools which were not at Silva’s disposal. At the same time, we (...) tried to keep in mind, so much as possible, the gist of his standpoint. (shrink)

Suppose T is superstable. Let ≤ denote the fundamental order on complete types, [ p] the class of the bound of p, and U(--) Lascar's foundation rank (see [LP]). We prove THEOREM 1. If $q and there is no r such that $q , then U(q) + 1 = U(p). THEOREM 2. Suppose $U(p) and $\xi_1 is a maximal descending chain in the fundamental order with ξ κ = [ p]. Then k = U(p). That the finiteness of U(p) in (...) Theorem 2 is necessary follows from THEOREM 3. There is an ω-stable theory with a type p ∈ S 1 (φ) such that (1) U(p) = ω + 1, and (2) there is a maximal descending chain of proper extensions of [ p] which has order type ω. (shrink)

This paper discusses two combinatorial problems in stability theory. First we prove a partition result for subsets of stable models: for any A and B, we can partition A into |B |<κ(T ) pieces, Ai | i < |B |<κ(T ) , such that for each Ai there is a Bi ⊆ B where |Bi| < κ(T ) and Ai..

We define the notion of generic for an arbitrary subgroup H of a stable group, and show that H has a definable hull with the same generic properties. We then apply this to the theory of stable fields.

In NIP theories, generically stable Keisler measures can be characterized in several ways. We analyze these various forms of “generic stability” in arbitrary theories. Among other things, we show that the standard definition of generic stability for types coincides with the notion of a frequency interpretation measure. We also give combinatorial examples of types in NSOP theories that are finitely approximated but not generically stable, as well as ϕ-types in simple theories that are definable and finitely satisfiable in a small (...) model, but not finitely approximated. Our proofs demonstrate interesting connections to classical results from Ramsey theory for finite graphs and hypergraphs. (shrink)

In this paper we prove three theorems about first-order theories that are categorical in a higher power. The first theorem asserts that such a theory either is totally categorical or there exist prime and minimal models over arbitrary base sets. The second theorem shows that such theories have a natural notion of dimension that determines the models of the theory up to isomorphism. From this we conclude that $I(T, \aleph_\alpha) = \aleph_0 +|\alpha|$ where ℵ α = the number of formulas (...) modulo T-equivalence provided that T is not totally categorical. The third theorem gives a new characterization of these theories. (shrink)

A countably infinite relational structure M is called absolutely ubiquitous if the following holds: whenever N is a countably infinite structure, and M and N have the same isomorphism types of finite induced substructures, there is an isomorphism from M to N. Here a characterisation is given of absolutely ubiquitous structures over languages with finitely many relation symbols. A corresponding result is proved for uncountable structures.

We define a new type of “shatter function” for set systems that satisfies a Sauer–Shelah type dichotomy, but whose polynomial-growth case is governed by Shelah’s two-rank instead of VC dimension. We identify the least exponent bounding the rate of growth of the shatter function, the quantity analogous to VC density, with Shelah’s $\omega $ -rank.

§1. Introduction. By and large, definitions of a differentiable structure on a set involve two ingredients, topology and algebra. However, in some cases, partial information on one or both of these is sufficient. A very simple example is that of the field ℝ where algebra alone determines the ordering and hence the topology of the field:In the case of the field ℂ, the algebraic structure is insufficient to determine the Euclidean topology; another topology, Zariski, is associated with the ield but (...) this will be too coarse to give a diferentiable structure.A celebrated example of how partial algebraic and topological data determines a differentiable structure is Hilbert's 5th problem and its solution by Montgomery-Zippin and Gleason.The main result which we discuss here is of a similar flavor: we recover an algebraic and later differentiable structure from a topological data. We begin with a linearly ordered set ⟨M, <⟩, equipped with the order topology, and its cartesian products with the product topologies. We then consider the collection of definable subsets of Mn, n = 1, 2, …, in some first order expansion ℳ of ⟨M, <⟩. (shrink)

We extend Morley's Theorem to show that if a theory is κ-p-categorical for some uncountable cardinal κ, it is uncountably categorical. We then discuss ω-p-categoricity and provide examples to show that similar extensions for the Baldwin-Lachlan and Lachlan Theorems are not possible.

We address the classification of the possible finitely-additive probability measures on the Boolean algebra of definable subsets of M which are invariant under the natural action of $\operatorname{Aut}(M)$ . This pursuit requires a generalization of Shelah's forking formulas [8] to "essentially measure zero" sets and an application of Myer's "rank diagram" [5] of the Boolean algebra under consideration. The classification is completed for a large class of ℵ 0 -categorical structures without the independence property including those which are stable.

We study the properties of the independence relation given by weak dividing in simple theories. We also analyze abstract independence notions satisfying various axioms and relate these to the simple case.

We define the notion has the NIP (not the independence property) in A, where A is a subset of a model, and give some equivalences by translating results from function theory. We also discuss the number of coheirs when A is not necessarily countable, and revisit the notion “ has the NOP (not the order property) in a model M”.

By extending the underlying data structure by new elements, we also extend the intput/output relation generated by a program i.e., no existing run is killed, and no new one lying entirely in the old structure is created. We investigate this stability property for the weak second order semantics derived from nonstandard time models. It turns out that the light face, i.e., parameterless collection principle always induces stable semantics, but the bold face one may be unstable. We give an example where (...) an elementary extension kills a bold face run showing also that the light face semantics is strictly weaker than the bold face one. (shrink)

We prove here:Theorem. LetT be a countable complete superstable non ω-stable theory with fewer than continuum many countable models. Then there is a definable groupG with locally modular regular generics, such thatG is not connected-by-finite and any type inG eq orthogonal to the generics has Morley rank.Corollary. LetT be a countable complete superstable theory in which no infinite group is definable. ThenT has either at most countably many, or exactly continuum many countable models, up to isomorphism.

§1. Introduction. By and large, definitions of a differentiable structure on a set involve two ingredients, topology and algebra. However, in some cases, partial information on one or both of these is sufficient. A very simple example is that of the field ℝ where algebra alone determines the ordering and hence the topology of the field:In the case of the field ℂ, the algebraic structure is insufficient to determine the Euclidean topology; another topology, Zariski, is associated with the ield but (...) this will be too coarse to give a diferentiable structure.A celebrated example of how partial algebraic and topological data determines a differentiable structure is Hilbert's 5th problem and its solution by Montgomery-Zippin and Gleason.The main result which we discuss here is of a similar flavor: we recover an algebraic and later differentiable structure from a topological data. We begin with a linearly ordered set ⟨M, <⟩, equipped with the order topology, and its cartesian products with the product topologies. We then consider the collection of definable subsets of Mn, n = 1, 2, …, in some first order expansion ℳ of ⟨M, <⟩. (shrink)

Rings which, from the ring-theoretic point of view, are very different may well have categories of modules which are extremely similar. More generally, the category of modules over a ring may contain many other categories of modules. Ideas from model theory are of use in elucidating this state of affairs. In particular we investigate the model-theoretic effect of tilting functors between categories of modules.