We adapt the notion from [7] and [2] of a (relatively) definable subset of A u t ( M ) when M is a saturated structure, to the case A u t ( M / A ) when M is atomic and strongly ω -homogeneous (over a set A ). We discuss the existence and uniqueness of invariant measures on the Boolean algebra of definable subsets of A u t ( M / A ) . For example when T is stable, we have existence and uniqueness. We also discuss the compatibility of our definability notions with definable Galois cohomology from [12] and differential Galois theory.

Abstract As a continuation of the work of the third author in [5], we make further observations on the features of Galois cohomology in the general model theoretic context. We make explicit the connection between forms of definable groups and first cohomology sets with coefficients in a suitable automorphism group. We then use a method of twisting cohomology (inspired by Serre’s algebraic twisting) to describe arbitrary fibres in cohomology sequences—yielding a useful “finiteness” result on cohomology sets. Applied to the special case of differential fields and Kolchin’s constrained cohomology, we complete results from [3] by proving that the first constrained cohomology set of a differential algebraic group over a bounded, differentially large, field is countable.

Characterizing neural networks in terms of better-understood formal systems has the potential to yield new insights into the power and limitations of these networks. Doing so for transformers remains an active area of research. Bhattamishra and others have shown that transformer encoders are at least as expressive as a certain kind of counter machine, while Merrill and Sabharwal have shown that fixed-precision transformer encoders recognize only languages in uniform $TC^0$. We connect and strengthen these results by identifying a variant of first-order logic with counting quantifiers that is simultaneously an upper bound for fixed-precision transformer encoders and a lower bound for transformer encoders. This brings us much closer than before to an exact characterization of the languages that transformer encoders recognize.

Abstract We discuss the role of weakly normal formulas in the theory of thorn forking, as part of a commentary on the paper [5]. We also give a counterexample to Corollary 4.2 from that paper, and in the process discuss “theories with selectors.”

Abstract The aim of this paper is to develop the theory of groups definable in the p-adic field ${{\mathbb {Q}}_p}$ , with “definable f-generics” in the sense of an ambient saturated elementary extension of ${{\mathbb {Q}}_p}$ . We call such groups definable f-generic groups. So, by a “definable f-generic” or $dfg$ group we mean a definable group in a saturated model with a global f-generic type which is definable over a small model. In the present context the group is definable over ${{\mathbb {Q}}_p}$ , and the small model will be ${{\mathbb {Q}}_p}$ itself. The notion of a $\mathrm {dfg}$ group is dual, or rather opposite to that of an $\operatorname {\mathrm {fsg}}$ group (group with “finitely satisfiable generics”) and is a useful tool to describe the analogue of torsion-free o-minimal groups in the p-adic context. In the current paper our group will be definable over ${{\mathbb {Q}}_p}$ in an ambient saturated elementary extension $\mathbb {K}$ of ${{\mathbb {Q}}_p}$ , so as to make sense of the notions of f-generic type, etc. In this paper we will show that every definable f-generic group definable in ${{\mathbb {Q}}_p}$ is virtually isomorphic to a finite index subgroup of a trigonalizable algebraic group over ${{\mathbb {Q}}_p}$ . This is analogous to the o-minimal context, where every connected torsion-free group definable in $\mathbb {R}$ is isomorphic to a trigonalizable algebraic group [5, Lemma 3.4]. We will also show that every open definable f-generic subgroup of a definable f-generic group has finite index, and every f-generic type of a definable f-generic group is almost periodic, which gives a positive answer to the problem raised in [28] of whether f-generic types coincide with almost periodic types in the p-adic case.

Abstract For G a group definable in a saturated model of a NIP theory T, we prove that there is a smallest type-definable subgroup H of G such that the quotient G / H is stable. This generalizes the existence of G00, the smallest type-definable subgroup of G of bounded index.

For G a group definable in some structure M, we define notions of “definable” compactification of G and “definable” action of G on a compact space X (definable G-flow), where the latter is under a definability of types assumption on M. We describe the universal definable compactification of G as G⁎/(G⁎)M00 and the universal definable G-ambit as the type space SG(M). We also point out the existence and uniqueness of “universal minimal definable G-flows”, and discuss issues of amenability and extreme amenability in this definable category, with a characterization of the latter. For the sake of completeness we also describe the universal (Bohr) compactification and universal G-ambit in model-theoretic terms, when G is a topological group (although it is essentially well-known).

Abstract We prove two results about generically stable typespin arbitrary theories. The first, on existence of strong germs, generalizes results from [2] on stably dominated types. The second is an equivalence of forking and dividing, assuming generic stability ofp(m)for allm. We use the latter result to answer in full generality a question posed by Hasson and Onshuus: IfP(x) εS(B) is stable and does not fork overAthenprestrictionAis stable. (They had solved some special cases.)

Abstract We give a commentary on Newelski's suggestion or conjecture [8] that topological dynamics, in the sense of Ellis [3], applied to the action of a definable groupG(M) on its “external type space”SG.ext(M), can explain, account for, or give rise to, the quotientG/G00, at least for suitable groups inNIPtheories. We give a positive answer for measure-stable (orf sg) groups inNIPtheories. As part of our analysis we show the existence of “externally definable” generics ofG(M) for measure-stable groups. We also point out that forGdefinably amenable (in aNIPtheory)G/G00can be recovered, via the Ellis theory, from a natural Ellis semigroup structure on the space of globalf-generic types.

Abstract We clarify and correct some statements and results in the literature concerning unimodularity in the sense of Hrushovski [7], and measurability in the sense of Macpherson and Steinhorn [8], pointing out in particular that the two notions coincide for strongly minimal structures and that another property from [7] is strictly weaker, as well as “completing” Elwes' proof [5] that measurability implies 1-basedness for stable theories.

Abstract We give some sufficient conditions for a predicate P in a complete theory T to be “stably embedded”. Let be P with its “induced ∅-definable structure”. The conditions are that (or rather its theory) is “rosy”. P has NIP in T and that P is stably 1-embedded in T. This generalizes a recent result of Hasson and Onshuus [6] which deals with the case where P is o-minimal in T. Our proofs make use of the theory of strict nonforking and weight in NIP theories ([3], [10]).

Abstract We introduce and study the notions of a PAC-substructure of a stable structure, and aboundedsubstructure of an arbitrary substructure, generalizing [10]. We give precise definitions and equivalences, saying what it means for properties such as PAC to be first order, study some examples (such as differentially closed fields) in detail, relate the material to generic automorphisms, and generalize a “descent theorem” for pseudo-algebraically closed fields to the stable context. We also point out that the elementary invariants of pseudo-algebraically closed fields from [6] are also valid for pseudo-differentially closed fields.

Herzog and Rothmaler gave the following purely topological characterization of stable theories. (See the exercises 11.3.4 – 11.3.7 in [2]). A complete theory T is stable iff for any model M and any extension M ⊂ B the restriction map S(B) → S(M) has a continuous section. In fact, if T is stable, taking the unique non-forking extension defines a continuous section of S(B) → S(A) for all subsets A of B, provided A is algebraically closed in Teq. Herzog and Rothmaler asked, if, for stable T, there is a continuous section for any subset A of B. Or, equivalently, if for any A, S(acleq(A)) → S(A) has a continuous section. This is an interesting problem, also for unstable T. Is it true that for any T and any set of parameters A the restriction map S(acl(A)) → S(A) has a continuous section? We answer the question by the following two theorems. Theorem 1. Let A be a subset of a model of T. Assume that the Boolean algebra of acl(A)-definable formulas is generated by • some countable set of formulas, • all A–definable formulas, • all formulas which are atomic over acl(A). Then S(acl(A)) → S(A) has a continuous section. The conditions of the theorems are satisfied if, for example, L and A are countable, or, if there are only countably many non-isolated types over acl(A). Theorem 2. There is a theory of Morley rank 2 and Morley degree 1 such that S(acl(∅)) → S(∅) has no continuous section.

Abstract We prove that any countable simple unidimensional theoryTis supersimple, under the additional assumptions thatTeliminates hyperimaginaries and that theDϕ-ranks are finite and definable.

Abstract We point out that a certain complex compact manifold constructed by Lieberman has the dimensional order property, and has U-rank different from Morley rank. We also give a sufficient condition for a Kähler manifold to be totally degenerate (that is, to be an indiscernible set, in its canonical language) and point out that there are K3 surfaces which satisfy these conditions.

Abstract 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.

A hyperimaginary is an equivalence class of a type-definable equivalence relation on tuples of possibly infinite length. The notion was recently introduced in [1], mainly with reference to simple theories. It was pointed out there how hyperimaginaries still remain in a sense within the domain of first order logic. In this paper we are concerned with several issues: on the one hand, various levels of complexity of hyperimaginaries, and when hyperimaginaries can be reduced to simpler hyperimaginaries. On the other hand the issue of what information about hyperimaginaries in a saturated structure M can be obtained from the abstract group Aut(M). In Section 2 we show that if T is simple and canonical bases of Lascar strong types exist in Meq then hyperimaginaries can be eliminated in favour of sequences of ordinary imaginaries. In Section 3, given a type-definable equivalence relation with a bounded number of classes, we show how the quotient space can be equipped with a certain compact topology. In Section 4 we study a certain group introduced in [5], which we call the Galois group of T, develop a Galois theory and make the connection with the ideas in Section 3. We also give some applications, making use of the structure of compact groups. One of these applications states roughly that bounded hyperimaginaries can be eliminated in favour of sequences of finitary hyperimaginaries. In Sections 3 and 4 there is some overlap with parts of Hrushovski's paper [2].

Abstract We point out that the theory of difference fields with algebraically closed fixed field has no model companion.

In this paper we construct a non-CM-trivial stable theory in which no infinite field is interpretable. In fact our theory will also be trivial and ω-stable, but of infinite Morley rank. A long term aim would be to find a nonCM-trivial theory which has finite Morley rank (or is even strongly minimal) and does not interpret a field. The construction in this paper is direct, and is a “3-dimensional” version of the free pseudoplane. In a sense we are cheating: the original point of the notion ofCM-triviality was to describe the geometry of a strongly minimal set, or even of a regular type. In our example, non-CM-triviality will come from the behaviour of three orthogonal regular types. A stable theory is said to beCM-trivial if wheneverA⊆Band acl(Ac) ∩ acl(B) = acl(A) inTeq, then Cb(stp(c/A)) ⊆ Cb(stp(c/B)). ( An infinite stable field will not beCM-trivial.) The notion is due to Hrushovski [3], where he gave several equivalent definitions, as well as showing that his new strongly minimal sets constructed “ab ovo” wereCM-trivial. The notion was studied further in [6] where it was shown thatCM-trivial groups of finite Morley rank are nilpotent-by-finite. These results were generalized in various ways to the superstable case in [8].

In this paper we discuss several generalization of theorems from stability theory to simple theories. Cherlin and Hrushovski, in [2] develop a substitute for canonical bases in finite rank, ω-categorical supersimple theories. Motivated by methods there, we prove the existence of canonical bases (in a suitable sense) for types in any simple theory. This is done in Section 2. In general these canonical bases will (as far as we know) exist only as “hyperimaginaries”, namely objects of the forma/Ewhereais a possibly infinite tuple andEa type-definable equivalence relation. (In the supersimple, ω-categorical case, these reduce to ordinary imaginaries.) So in Section 1 we develop the general theory of hyperimaginaries and show how first order model theory (including the theory of forking) generalises to hyperimaginaries. We go on, in Section 3 to show the existence and ubiquity of regular types in supersimple theories, ω-categorical simple structures and modularity is discussed in Section 4. It is also shown here how the general machinery of simplicity simplifies some of the general theory of smoothly approximable (or Lie-coordinatizable) structures from [2]. Throughout this paper we will work in a large, saturated modelMof a complete theoryT. All types, sets and sequences will have size smaller than the size ofM. We will assume that the reader is familiar with the basics of forking in simple theories as laid out in [4] and [6]. For basic stability-theoretic results concerning regular types, orthogonality etc., see [1] or [9].

CM-triviality of a stable theory is a notion introduced by Hrushovski [1]. The importance of this property is first that it holds of Hrushovski's new non 1-based strongly minimal sets, and second that it is still quite a restrictive property, and forbids the existence of definable fields or simple groups (see [2]). In [5], Frank Wagner posed some questions aboutCM-triviality, asking in particular whether a structure of finite rank, which is “coordinatized” byCM-trivial types of rank 1, is itselfCM-trivial. (Actually Wagner worked in a slightly more general context, adapting the definitions to a certain “local” framework, in which algebraic closure is replaced byP-closure, forPsome family of types. We will, however, remain in the standard context, and will just remark here that it is routine to translate our results into Wagner's framework, as well as to generalise to the superstable theory/regular type context.) In any case we answer Wagner's question positively. Also in an attempt to put forward some concrete conjectures about the possible geometries of strongly minimal sets (or stable theories) we tentatively suggest a hierarchy of geometric properties of forking, the first two levels of which correspond to 1-basedness andCM-triviality respectively. We do not know whether this is a strict hierarchy (or even whether these are the “right” notions), but we conjecture that it is, and moreover that a counterexample to Cherlin's conjecture can be found at level three in the hierarchy.

Abstract We give a characterisation of forking in the context of simple theories in terms of the fundamental order.

Abstract We continue the study of simple theories begun in [3] and [5]. We first find the right analogue of definability of types. We then develop the theory of generic types and stabilizers for groups definable in simple theories. The general ideology is that the role of formulas (or definability) in stable theories is replaced by partial types (or ∞-definability) in simple theories.

In this paper we develop some basic features of Galois cohomology, specifically the connection between first Galois cohomology groups and principal homogeneous spaces, in a model-theoretic context. “Descent theory” also fits into our approach. The model theory involved is elementary, and the reader is referred to [2]. It should be said that we make crucial use of Meq in our analysis. The reader is also referred to Poizat's seminal paper “Une theorie de Galois imaginaire” ([6]). Although our results do not depend on Poizat's work, it is in his paper that the model-theoretic context is suggested for a generalised treatment of Galois theory. Nothing in this paper is particularly deep. We are concerned mainly with translating between the Galois cohomological language and the language of definable sets and definable families of definable sets. We will introduce (in a suitable context) the notion of a definable cocycle (from an automorphism group to a definable group G). The (classical) situation of profinite and continuous cocycles will be a special case. Kolchin's theory of constrained cohomology will be another special case, and our results yield a substantially simpler proof of his Theorem 5 from Chapter VII of [4]. In any case model-theorists will see that definable cocycles correspond to objects with which they are already quite familiar—commuting families of definable bijections.

Let L0, L1 and L2 be countable languages with L ∩ L1 = L0. Let M0 be an L0-structure and Mi, an expansion of M0 to an Li,-structure (i = 1,2). We will call an L1 ∪ L2-structure M an amalgamation of M1 and M2 if M∣Li ≅ Mi, (i = 1,2). Let's consider the following problem. (*) Suppose that both M1 and M2 belong to the class . Can we always find an amalgamation M in ? Of course the existence of such an amalgamation depends on the class L. Some examples of and the answers are given below. 1. = Countably saturated strongly minimal structures with the DMP In [3], Hrushovski showed that any two strongly minimal theories formulated in totally different languages have a common extension which is still strongly minimal and with the DMP (DMP is the property that states that if a point is sufficiently close to ā, then φ( , ) has the same rank and the same degree as φ( , ā).) His proof essentially shows that if L0 = ∅ then any two countably saturated strongly minimal structures with the DMP have a strongly minimal amalgamation. Also he gave an example that shows the condition L0 = ∅ is necessary. 2. = ℵ1-categorical countable structures. Let M1 be the structure (ℚ, +) and let M2 be the {E, F}-structure defined by: (i) E is an equivalence relation which divides the universe into two infinite classes A and B, (ii) F is a bijection between A and B.

Abstract The notion of CM-triviality was introduced by Hrushovski, who showed that his new strongly minimal sets have this property. Recently Baudisch has shown that his new ω1-categorical group has this property. Here we show that any group of finite Morley rank definable in a CM-trivial theory is nilpotent-by-finite, or equivalently no simple group of finite Morley rank can be definable in a CM-trivial theory.

Abstract In this paper we establish the following theorems. Theorem A. Let T be a complete first-order theory which is uncountable, Then: (i) I(∣T∣, T) ≥ ℵ0 (ii) If T is not unidimensional, then for any λ ≥ ∣T∣, I(λ, T) ≥ ℵ0. Theorem B. Let T be superstable, not totally transcendental and nonmultidimensional. Let θ(x) be a formula of least R∞ rank which does not have Morley rank, and let p be any stationary completion of θ which also fails to have Morley rank. Then p is regular and locally modular.

In this paper we study nonmultidimensional superstable theories T, possibly in an uncountable language, and develop some techniques permitting the generalisation of certain results from the finite rank (and/or countable language) context to the general case. We prove, among other things, the following: there is a set A0 of parameters, which has cardinality at most ∣T∣, and in the finite-dimensional case is finite, such that over any B ⊇ A0 there is a locally atomic model. One of the consequences of this is that if C is the monster model of T, φ(x) is a formula over A0, φC ⊇ X and (X, φC) satisfies the Tarski-Vaught condition after adding names for A0, then there is an elementary substructure M of C containing A0 such that φM = X. Applications to the spectrum problem will appear in [Ch-P]. In fact, all the components of the machinery we develop are already present in the general theory. One such component involves a stratification of the regular types of T using a generalized notion of weakly minimal formula. This appears in [Sh, Chapter V and the proof of IX.2.4] and also in [P2]. A second component involves definable groups which arise as ‘binding” groups. The existence of such groups, under certain hypotheses on the behavior of nonorthogonality, is due to Hrushovski [Hr1], and our use of them to help obtain “j-constructible” models is similar to their use in [Bu-Sh].

Abstract Let T be a complete O-minimal theory in a language L. We first give an elementary proof of the result (due to Marker and Steinhorn) that all types over Dedekind complete models of T are definable. Let L* be L together with a unary predicate P. Let T* be the L*-theory of all pairs (N, M), where M is a Dedekind complete model of T and N is an ⅼMⅼ+-saturated elementary extension of N (and M is the interpretation of P). Using the definability of types result, we show that T* is complete and we give a simple set of axioms for T*. We also show that for every L*-formula ϕ(x) there is an L-formula ψ(x) such that T* ⊢ (∀x)(P(x) → (ϕ(x) ↔ ψ(x)). This yields the following result: Let M be a Dedekind complete model of T. Let ϕ(x, y) be an L-formula where l(y) – k. Let X = {X ⊂ Mk: for some a in an elementary extension N of M, X = ϕ(a, y)N ∩ Mk}. Then there is a formula ψ(y, z) of L such that X = {ψ(y, b)M: b in M}.

In [MP] Marker and Pillay showed that if X ⊂ Cn is constructible but (C, +, X) is not locally modular, then multiplication is definable in the structure (C, +,X). That result extended earlier results of Martin [M] and Rabinovich and Zil'ber [RZ]. Here we will examine additive reducts of R and Qp. Definition. A subset X of Rn is called semialgebraic if it is definable in the structure (R, +,·). A subset X of Rn is called semilinear if it is definable in the structure (R, +, <,λr)r∈b, where λr is the function x ↦ rx [scalar multiplication by r]. Every semilinear set is a Boolean combination of sets of the form { : p ( ) = 0} and { : q( ) > 0}, where p( ) and q( ) are linear polynomials. Van den Dries asked the following question: if X is semialgebraic but not semilinear, can we define multiplication in (R, +, <,X)? This was answered negatively by Pillay, Scowcroft and Steinhorn. Theorem 1.1 [PSS]. Suppose X ⊂ Rnis semialgebraic and X ⊂ Infor some bounded interval I. Then multiplication is not definable in (R, +, <,X,λr)r∈R. In particular if X = · ∣ [0, l ]2, the graph of multiplication restricted to the unit interval, then X is not semilinear so we have a negative answer to van den Dries' question. Peterzil showed that this is the only restriction.

In this paper we study differential fields of characteristic 0 (with perhaps additional structure) whose theory is superstable. Our main result is that such a differential field has no proper strongly normal extensions in the sense of Kolchin [K1]. This is an approximation to the conjecture that a superstable differential field is differentially closed (although we believe the full conjecture to be false). Our result improves earlier work of Michaux [Mi] who proved that a (plain) differential field with quantifier elimination has no proper Picard-Vessiot extension. Our result is a generalisation of Michaux's, due to the fact that any plain differential field K with quantifier elimination is ω-stable. (Any quantifier free type over K defines a unique type over K in the sense of dc(k), the differential closure of K, and as we mention below the theory of differentially closed fields is ω-stable.) The proof of our main result depends on (i) Kolchin's theory [K3] which states that any strongly normal extension L of an algebraically closed differential field K is generated over K by an element η of some algebraic group G defined over CK, the constants of K, where η satisfies some specific differential equations over K related to invariant differential forms on G (η is “G-primitive” over K), and (ii) the fact that a superstable field has a unique generic type which is semiregular.

Here we consider some problems concerning regular types. In the first place we consider a strongly minimal set D. One can ask what is the strength of the assumption that D has (full) elimination of imaginaries (namely, every definable set X over D has as canonical parameter some tuple from D). We show that D cannot be locally modular. Nontriviality of D is immediate. However, to exclude the locally modular nontrivial case one has to understand structures of the form G/E, where G is a modular strongly minimal group and E is a definable equivalence relation on G with finite classes. We show that the quotient structure G/E can be obtained in two steps. First quotient by a finite subgroup K of G to obtain a strongly minimal group H. Now let Γ be a finite subgroup of the group Aff(H) of definable affine automorphisms of H (namely maps of the form x → αx + a, where α is a definable automorphism of H and a ∈ H), and quotient H by Γ (namely form the orbit space of H under Γ). It can clearly be arranged that Γ contains no nontrivial subgroup of translations. In the second place we look at a nontrivial modular regular type p whose pregeometry is actually a geometry. The geometry is then known to be (infinite-dimensional) projective geometry over a division ring F. We ask whether F is definable (internally to p). If F is finite, this is clear. In fact in this case p must have U-rank 1. So we assume F to be infinite. We are only able to show definability of F in the case where F is a field, using some results on 2-transitive subgroups of PGL [V]. Moreover in the superstable case we also observe that p is isolated.

Abstract We show that the structure (C, +, ·) has no proper non locally modular reducts which contain +. In other words, if X ⊂ Cn is constructible and not definable in the module structure (C, +, λa)a Є C (where λa denotes multiplication by a) then multiplication is definable in (C, +, X).

We point out that a group first order definable in a differentially closed field K of characteristic 0 can be definably equipped with the structure of a differentially algebraic group over K. This is a translation into the framework of differentially closed fields of what is known for groups definable in algebraically closed fields (Weil's theorem). I restrict myself here to showing (Theorem 20) how one can find a large “differentially algebraic group chunk” inside a group defined in a differentially closed field. The rest of the translation (Theorem 21) follows routinely, as in [B]. What is, perhaps, of interest is that the proof proceeds at a completely general (soft) model theoretic level, once Facts 1–4 below are known. Fact 1. The theory of differentially closed fields of characteristic 0 is complete and has quantifier elimination in the language of differential fields (+, ·,0,1, −1,d). Fact 2. Affine n-space over a differentially closed field is a Noetherian space when equipped with the differential Zariski topology. Fact 3. If K is a differentially closed field, k ⊆ K a differential field, and a and are in k, then a is in the definable closure of k ◡ iff a ∈ ‹ › (where k ‹ › denotes the differential field generated by k and ). Fact 4. The theory of differentially closed fields of characteristic zero is totally transcendental (in particular, stable).

We prove that if T is a stable theory with only a finite number (>1) of countable models, then T contains a type-definable pseudoplane. We also show that for any stable theory T either T contains a type-definable pseudoplane or T is weakly normal (in the sense of [9]).

Abstract Let M be a saturated model of a superstable theory and let G = Aut(M). We study subgroups H of G which contain G(A), A the algebraic closure of a finite set, generalizing results of Lascar [L] as well as giving an alternative characterization of the simple superstable theories of [P]. We also make some observations about good, locally modular regular types p in the context of p-simple types.

Let M be an o-minimal structure or a p-adically closed field. Let be the space of complete n-types over M equipped with the following topology: The basic open sets of are of the form Ũ = {p ∈ Sn (M): U ∈ p} for U an open definable subset of Mn. is a spectral space. (For M = K a real closed field, is precisely the real spectrum of K[X1, …, Xn]; see [CR].) We will equip with a sheaf of LM-structures (where LM is a suitable language). Again for M a real closed field this corresponds to the structure sheaf on (see [S]). Our main point is that when Th(M) has definable Skolem functions, then if p ∈ , it follows that M(p), the definable ultrapower of M at p, can be factored through Mp, the stalk at p with respect to the above sheaf. This depends on the observation that if M ≺ N, a ∈ Nn and f is an M-definable (partial) function defined at a, then there is an open M-definable set U ⊂ Nn with a ∈ U, and a continuous M-definable function g:U → N such that g(a) = f(a). In the case that M is an o-minimal expansion of a real closed field (or M is a p-adically closed field), it turns out that M(p) can be recovered as the unique quotient of Mp which is an elementary extension of M.

In this paper we introduce the notion of a first order topological structure, and consider various possible conditions on the complexity of the definable sets in such a structure, drawing several consequences thereof. Our aim is to develop, for a restricted class of unstable theories, results analogous to those for stable theories. The “material basis” for such an endeavor is the analogy between the field of real numbers and the field of complex numbers, the former being a “nicely behaved” unstable structure and the latter the archetypal stable structure. In this sense we try here to situate our work ono-minimal structures [PS] in a general topological context. Note, however, that thep-adic numbers, and structures definable therein, will also fit into our analysis. In the remainder of this section we discuss several ways of studying topological structures model-theoretically. Eventually we fix on the notion of a structure in which the topology is “explicitly definable” in the sense of Flum and Ziegler [FZ]. In §2 we introduce the hypothesis that every definable set is a Boolean combination of definable open sets. In §3 we introduce a “dimension rank” on (closed) definable sets. In §4 we consider structures on which this rank is defined, and for which also every definable set has a finite number of definably connected definable components. We show that prime models over sets exist under such conditions.

Dans Poizat [1981], le second auteur a montré qu'un sous-groupe infiniment définissable d'un groupe stable était intersection de sous-groupes définissables; il a posé la question de savoir si une relation d'équivalence E, infiniment définissable dans un modèle M d'une théorie stable T, était conjonction de relations d'équivalence définissables. Nous allons voir ici que c'est presque exact: c'est vrai si T est totalement transcendante, et, dans le cas général de stabilité E a toujours un raffinement E1 (plus précisément, E1 est la conjonction de E et de la relation “x et y ont même type”) qui a cette propriété; cela montre que cette relation E n'introduit pas d'imaginaires d'une nature vraiment différente de celle des imaginaires de Shelah: dans une théorie stable, un imaginaire infinitaire n'est rien d'autre qu'un ensemble d'imaginaires finis. La démonstration du théorème principal de cette note s'appuie lourdement sur la construction Meq de Shelah, la machinerie de la déviation, les paramètres imaginaires canoniques pour la définition d'un type stable, etc…. Pour tout cela, les références adéquates sont Shelah [1978], Pillay [1983], et Poizat [1985, Chapitre 16]. Nouscommençons par préciser ce que nous entendons par “relation d'équivalence infiniment définissable”: une collection de formules e( , ȳ), et ȳ étant de longueur n, telle que, pour tout modèle M de T, les couples ( , ȳ) qui les satisfont toutes forment une rélation d'équivalence E.

Abstract For a countable complete o-minimal theory T, we introduce the notion of a sequentially complete model of T. We show that a model of T is sequentially complete if and only if ≺ for some Dedekind complete model . We also prove that if T has a Dedekind complete model of power greater than , then T has Dedekind complete models of arbitrarily large powers. Lastly, we show that a dyadic theory—namely, a theory relative to which every formula is equivalent to a Boolean combination of formulas in two variables—that has some Dedekind complete model has Dedekind complete models in arbitrarily large powers.

Developpement de la theorie de la bifurcation. Demonstration d'un theoreme de normalisation. Caracterisations de la bifurcation dans les theories stables

Let M be an O-minimal structure. We use our understanding, acquired in [KPS], of the structure of definable sets of n-tuples in M, to study definable (in M) equivalence relations on Mn. In particular, we show that if E is an A-definable equivalence relation on Mn (A ⊂ M) then E has only finitely many classes with nonempty interior in Mn, each such class being moreover also A-definable. As a consequence, we are able to give some conditions under which an O-minimal theory T eliminates imaginaries (in the sense of Poizat [P]). If L is a first order language and M an L-structure, then by a definable set in M, we mean something of the form X ⊂ Mn, n ≥ 1, where X = {(a1…,an) ∈ Mn: M ⊨ϕ(ā)} for some formula ∈ L(M). (Here L(M) means L together with names for the elements of M.) If the parameters from come from a subset A of M, we say that X is A-definable. M is said to be O-minimal if M = (M, <,…), where < is a dense linear order with no first or last element, and every definable set X ⊂ M is a finite union of points, and intervals (a, b) (where a, b ∈ M ∪ {± ∞}). (This notion is as in [PS] except here we demand the underlying order be dense.) The complete theory T is said to be O-minimal if every model of T is O-minimal. (Note that in [KPS] it is proved that if M is O-minimal, then T = Th(M) is O-minimal.) In the remainder of this section and in §2, M will denote a fixed but arbitrary O-minimal structure. A,B,C,… will denote subsets of M.

In this paper we prove that if T is the complete elementary diagram of a countable structure and is a theory as in the title, then Vaught's conjecture holds for T. This result is Theorem 7, below. In the process of establishing this proposition, in Theorem 3 we give a sufficient condition for a superstable theory having only countably many types without parameters to be ω-stable. Familiarity with the rudiments of stability theory, as presented in [3] and [4], will be supposed throughout. The notation used is, by now, standard. We begin by giving a new proof of a lemma due to J. Saffe in [6]. For T stable, recall that the multiplicity of a type p over a set A ⊆ ℳ ⊨ T is the cardinality of the collection of strong types over A extending p. Lemma 1 (Saffe). Let T be stable, A ⊆ ℳ ⊨ T. If t(b̄, A) has infinite multiplicity and t(c̄, A) has finite multiplicity, then t(b̄, A ∪ {c̄}) has infinite multiplicity. Proof. We suppose not and work for a contradiction. Let ‹b̄γ:γ ≤ α›, α ≥ ω, be a list of elements so that t(b̄γ, A) = t(b̄, A) for all γ ≤ α, and st(b̄γ, A) ≠ st(b̄δ, A) for γ ≠ δ. Furthermore, let c̄γ satisfy t(b̄γ∧c̄γ, A) = t(b̄ ∧ c̄, A) for each γ < α. Since t(c̄, A) has finite multiplicity, we may assume for all γ, δ < α. that st(c̄γ, A) = st(c̄δ, A). For each γ < α there is an automorphism fγ of the so-called “monster model” of T (a sufficiently large, saturated model of T) that preserves strong types over A and is such that f(c̄γ) = c̄0.

Abstract We define a hierarchy on the regular types of an ω-stable nonmultidimensional theory, using generalised notions of algebraic and strongly minimal formulae. As an application we show that any resplendent model of an ω-stable finite-dimensional theory is saturated.

An impressive theory has been developed, largely by Shelah, around the notion of a stable theory. This includes detailed structure theorems for the models of such theories as well as a generalized notion of independence. The various stability properties can be defined in terms of the numbers of types over sets, or in terms of the complexity of definable sets. In the concrete examples of stable theories, however, one finds an important distinction between “positive” and “negative” information, such a distinction not being an a priori consequence of the general definitions. In the naive examples this may take the form of distinguishing between say a class of a definable equivalence relation and the complement of a class. In the more algebraic examples, this distinction may have a “topological” significance, for example with the Zariski topology on (the set of n-tuples of) an algebraically closed field, the “closed” sets being those given by sets of polynomial equalities. Note that in the latter case, every definable set is a Boolean combination of such closed sets (the definable sets are precisely the constructible sets). Similarly, stability conditions in practice reduce to chain conditions on certain “special” definable sets (e.g. in modules, stable groups). The aim here is to develop and present such notions in the general (model-theoretic) context. The basic notion is that of an “equation”. Given a complete theory T in a language L, an L-formula φ(x̄, ȳ) is said to be an equation (in x̄) if any collection Φ of instances of φ(i.e. of formulae φ(x̄, ā)) is equivalent to a finite subset Φ′ ⊂ Φ.

A model M (of a countable first order language) is said to be finitely generated if it is prime over a finite set, namely if there is a finite tuple ā in M such that (M, ā) is a prime model of its own theory. Similarly, if A ⊂ M, then M is said to be finitely generated overA if there is finite ā in M such that M is prime over A ⋃ ā. (Note that if Th(M) has Skolem functions, then M being prime over A is equivalent to M being generated by A in the usual sense, that is, M is the closure of A under functions of the language.) We show here that if N is ā model of an ω-stable theory, M ≺ N, M is finitely generated, and N is finitely generated over M, then N is finitely generated. A corollary is that any countable model of an ω-stable theory is the union of an elementary chain of finitely generated models. Note again that all this is trivial if the theory has Skolem functions. The result here strengthens the results in [3], where we show the same thing but assuming in addition that the theory is either nonmultidimensional or with finite αT. However the proof in [3] for the case αT finite actually shows the following which does not assume ω-stability): Let A be atomic over a finite set, tp(ā / A) have finite Cantor-Bendixson rank, and B be atomic over A ⋃ ā. Then B is atomic over a finite set.

We take a fixed countable model M0, and we look at the structure of and number of its countable elementary extensions (up to isomorphism over M0). Assuming that S(M0) is countable, we prove that if N is a weakly minimal extension of , and if then there is an elementary embedding of N into M over M0), then N is homogeneous over M0. Moreover the condition that ∣S(M0)∣ = ℵ0 cannot be removed. Under the hypothesis that M0 contains no infinite set of tuples ordered by a formula, we prove that M0 has infinitely many countable elementary extensions up to isomorphism over M0. A preliminary result is that all types over M0 are definable, and moreover is definable over M0 if and only if is definable over M0 (forking symmetry). We also introduce a notion of relative homogeneity, and show that a large class of elementary extensions of M0 are relatively homogeneous over M0 (under the assumptions that M0 has no order and S(M0) is countable). I will now discuss the background to and motivation behind the results in this paper, and also the place of this paper relative to other conjectures and investigations. To simplify notation let T denote the complete diagram of M0. First, our result that if M0 has no order then T has infinitely many countable models is related to the following conjecture: any theory with a finite number (more than one) of countable models is unstable.

We prove first that if T is a countable complete theory with n(T), the number of countable models of T, equal to three, then T is similar to the Ehrenfeucht example of such a theory. Woodrow [4] showed that if T is in the same language as the Ehrenfeucht example, T has elimination of quantifiers, and n(T) = 3 then T is very much like this example. All known examples of theories T with n(T) finite and greater than one are based on the Ehrenfeucht example. We feel that such theories are a pathological case. Our second theorem strengthens the main result of [2]. The theorem in the present paper says that if T is a countable theory which has a model in which all the elements of some infinite definable set are algebraic of uniformly bounded degree, then n(T) ≥ 4. It is known [3] that if n(T) > 1, then n(T) > 3, so our result is the first nontrivial step towards proving that n(T) ≥ ℵ0. We would also like, of course, to prove the result without the uniform bound on the finite degrees of the elements in the subset. Theorem 2.1 is included in the author's Ph. D. thesis, as is a weaker version of Theorem 3.7. Thanks are due to Harry Simmons for his suggestions concerning the presentation of the material, and to Wilfrid Hodges for his advice while I was a Ph. D. student.

We prove that a countable complete theory whose prime model has an infinite definable subset, all of whose elements are named, has at least four countable models up to isomorphism. The motivation for this is the conjecture that a countable theory with a minimal model has infinitely many countable models. In this connection we first prove that a minimal prime model A has an expansion by a finite number of constants A′ such that the set of algebraic elements of A′ contains an infinite definable subset. We note that our main conjecture strengthens the Baldwin–Lachlan theorem. We also note that due to Vaught's result that a countable theory cannot have exactly two countable models, the weakest possible nontrivial result for a non-ℵ0-categorical theory is that it has at least four countable models. §1. Notation and preliminaries. Our notation follows Chang and Keisler [1], except that we denote models by A, B, etc. We use the same symbol to refer to the universe of a model. Models we refer to are always in a countable language. For T a countable complete theory we let n(T) be the number of countable models of T up to isomorphism. ∃n means ‘there are exactly n’.