We give an axiomatic framework for the non-modular simple 0-categorical structures constructed by Hrushovski. This allows us to verify some of their properties in a uniform way, and to show that these properties are preserved by iterations of the construction.

Following the introduction and preliminary investigations of analytic Zariski structures in Peatfield and Zilber (Ann pure Appl Logic 132:125–180, 2005) an example of an analytic Zariski structure extending an algebraically closed field is provided. The example is constructed using Hrushovski’s method of free amalgamation, and a topology is introduced in which we can verify the analytic Zariski axioms.

We describe strongly minimal theories Tn with finite languages such that in the chain of countable models of Tn, only the first n models have recursive presentations. Also, we describe a strongly minimal theory with a finite language such that every non-saturated model has a recursive presentation.

I prove a version of Schanuel's conjecture for Weierstrass equations in differential fields, answering a question of Zilber, and show that the linear independence condition in the statement cannot be relaxed.

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.

We provide a simple and transparent construction of Hrushovski's strongly minimal fusions in the case where the fused strongly minimal sets are vector spaces. We strengthen Hrushovski's result by showing that the strongly minimal fusions are model complete.

We introduce notions of strong and eventual strong non-isolation for types in countable, stable theories. For T superstable or small stable we prove a dichotomy theorem: a regular type over a finite domain is either eventually strongly non-isolated or is non-orthogonal to a NENI type . As an application we obtain the upper bound for Lascar’s rank of a superstable theory which is one-based or trivial, and has fewer than 20 non-isomorphic countable models.

We will study some aspects of the local structure of models of certain C-minimal theories. We will prove (theorem 19) that, in a sufficiently saturated C-minimal structure in which the algebraic closure has the exchange property and which is locally modular, we can construct an infinite type-definable group around any non trivial point (a term to be defined later). On va étudier ici certains aspects de la structure locale des modèles de certaines théories C-minimales. On va prouver (théorème 19) que, (...) dans une structure C-minimale suffisamment saturée, localement modulaire et dans laquelle la clôture algébrique permet de définir une notion de dimension, on peut construire un groupe type-définissable infini autour de tout point non trivial (terme à définir par la suite). (shrink)

Generalising Hrushovski's fusion technique we construct the free fusion of two strongly minimal theories T₁, T₂ intersecting in a totally categorical sub-theory T₀. We show that if, e.g., T₀ is the theory of infinite vector spaces over a finite field then the fusion theory Tω exists, is complete and ω-stable of rank ω. We give a detailed geometrical analysis of Tω, proving that if both T₁, T₂ are 1-based then, Tω can be collapsed into a strongly minimal theory, if some (...) additional technical conditions hold—all trivially satisfied if T₀ is the theory of infinite vector spaces over a finite field Fq. (shrink)

We build a new spectrum of recursive models (SRM(T)) of a strongly minimal theory. This theory is non-disintegrated, flat, model complete, and in a language with a finite structure.

We construct a nontrivial definable type V field topology on any dp-minimal field K that is not strongly minimal, and prove that definable subsets of Kn have small boundary. Using this topology and...

Summary. From known examples of theories T obtained by Hrushovski-constructions and of infinite Morley rank, properties are extracted, that allow the collapse to a finite rank substructure. The results are used to give a more model-theoretic proof of the existence of the new uncountably categorical groups in [3].

Generalizedn-gons are certain geometric structures (incidence geometries) that generalize the concept of projective planes (the nontrivial generalized 3-gons are exactly the projective planes).In a simplified world, every generalizedn-gon of finite Morley rank would be an algebraic one, i.e., one of the three families described in [9] for example. To our horror, John Baldwin [2], using methods discovered by Hrushovski [7], constructed ℵ1-categorical projective planes which are not algebraic. The projective planes that Baldwin constructed fail to be algebraic in a dramatic (...) way.Indeed, every algebraic projective plane over an algebraically closed field is Desarguesian [12]. In particular, an algebraically closed field (isomorphic to the base field) can be interpreted in every one of them. However, in the projective planes that Baldwin constructed, one cannot even interpret an infinite group.In this article we show that the same phenomenon occurs for the generalizedn-gons ifn≥ 3 is an odd integer. For each suchnwe constructmany nonisomorphic generalizedn-gons of finite Morley rank that do not interpret an infinite group. As one may expect, our method is inspired by Hrushovski and Baldwin, and we follow Baldwin's line of approach. Quite often our proofs are a verification of the fact that the proofs of Baldwin [2] forn= 3 carry over to an arbitrary positive odd integern(which is sometimes far from being obvious). As in [2], we begin by defining a certain collection of finite graphsK* and a binary relation ≤ on these graphs. We show that (K*, ≤) satisfies the amalgamation property. (shrink)

Several attempts have been done to distinguish “positive” information in an arbitrary first order theory, i.e., to find a well behaved class of closed sets among the definable sets. In many cases, a definable set is said to be closed if its conjugates are sufficiently distinct from each other. Each such definition yields a class of theories, namely those where all definable sets are constructible, i.e., boolean combinations of closed sets. Here are some examples, ordered by strength:Weak normality describes a (...) rather small class of theories which are well understood by now (see, for example, [P]). On the other hand, normalization is so weak that all theories, in a suitable context, are normalizable (see [HH]). Thus equational theories form an interesting intermediate class of theories. Little work has been done so far. The original work of Srour [S1, S2, S3] adopts a point of view that is closer to universal algebra than to stability theory. The fundamental definitions and model theoretic properties can be found in [PS], though some easy observations are missing there. Hrushovski's example of a stable non-equational theory, the first and only one so far, is described in the unfortunately unpublished manuscript [HS]. In fact, it is an expansion of the free pseudospace constructed independently by Baudisch and Pillay in [BP] as an example of a strictly 2-ample theory. Strong equationality, defined in [Hr], is also investigated in [HS]. (shrink)

We show that equational independence in the sense of Srour equals local non-forking. We then examine so-called almost equational theories where equational independence is a symmetric relation.

We provide a general framework for studying the expansion of strongly minimal sets by adding additional relations in the style of Hrushovski. We introduce a notion of separation of quantifiers which is a condition on the class of expansions of finitely generated models for the expanded theory to have a countable ω-saturated model. We apply these results to construct for each sufficiently fast growing finite-to-one function μ from 'primitive extensions' to the natural numbers a theory T μ of an expansion (...) of an algebraically closed field which has Morley rank 2. Finally, we show that if μ is not finite-to-one the theory may not be ω-stable. (shrink)

In this paper we study predimension inequalities in differential fields and define what it means for such an inequality to be adequate. Adequacy was informally introduced by Zilber, and here we give a precise definition in a quite general context. We also discuss the connection of this problem to definability of derivations in the reducts of differentially closed fields. The Ax-Schanuel inequality for the exponential differential equation (proved by Ax) and its analogue for the differential equation of the j-function (established (...) by Pila and Tsimerman) are our main examples of predimensions. We carry out a Hrushovski construction with the latter predimension and obtain a natural candidate for the first-order theory of the differential equation of the j-function. It is analogous to Kirby's axiomatisation of the theory of the exponential differential equation (which in turn is based on the axioms of Zilber's pseudo-exponentiation), although there are many significant differences. In joint work with Sebastian Eterović and Jonathan Kirby we have recently proven that the axiomatisation obtained in this paper is indeed an axiomatisation of the theory of the differential equation of the j-function, that is, the Ax-Schanuel inequality for the j-function is adequate. (shrink)

In a recent communication an uncountably categorical group has been constructed that has a non-locally-modular geometry and does not allow the interpretation of a field. We consider a system Δ of elementary axioms fulfilled by some special subgroups of the above group. We show that Δ is complete and stable, but not superstable. It is not even a R-group in the sense discussed by Wagner.

For every structure M of finite signature Mekler 781) has constructed a group G such that for every κ the maximal number of n -types over an elementary equivalent model of cardinality κ is the same for M and G . These groups are nilpotent of class 2 and of exponent p , where p is a fixed prime greater than 2. We consider stable structures M only and show that M is CM -trivial if and only if G is (...) CM -trivial. Furthermore, we obtain that the free group F 2 in the variety of 2 -nilpotent groups of exponent p>2 with ω free generators has a CM -trivial ω -stable theory. (shrink)

We define a generalized version of CM-triviality, and show that in the presence of enough regular types, or solubility, a stable CM-trivial group is nilpotent-by-finite. A torsion-free small CM-trivial stable group is abelian and connected. The first result makes use of a generalized version of the analysis of bad groups.

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. (shrink)

An ω-categorical supersimple group is finite-by-abelian-by-finite, and has finite SU-rank. Every definable subgroup is commensurable with an acl( $\emptyset$ )-definable subgroup. Every finitely based regular type in a CM-trivial ω-categorical simple theory is non-orthogonal to a type of SU-rank 1. In particular, a supersimple ω-categorical CM-trivial theory has finite SU-rank.

We construct a stable one-based, trivial theory with a reduct which is not trivial. This answers a question of John B. Goode. Using this, we construct a stable theory which is n-ample for all natural numbers n, and does not interpret an infinite group.

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]. (shrink)

§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 develop a category-theoretic framework for universal homogeneous objects, with some applications in the theory of Banach spaces, linear orderings, and in the topology of compact Hausdorff spaces.

We describe the progress of model theory in the last half century from the standpoint of how finite model theory might develop.

A study of smooth classes whose generic structures have simple theory is carried out in a spirit similar to Hrushovski 147; Simplicity and the Lascar group, preprint, 1997) and Baldwin–Shi 1). We attach to a smooth class K0, of finite -structures a canonical inductive theory TNat, in an extension-by-definition of the language . Here TNat and the class of existentially closed models of =T+,EX, play an important role in description of the theory of the K0,-generic. We show that if M (...) is the K0,-generic then MEX. Furthermore, if this class is an elementary class then Th=Th). The investigations by Hrushovski and Pillay , provide a general theory for forking and simplicity for the nonelementary classes, and using these ideas, we show that if K0,, where {,*}, has the joint embedding property and is closed under the Independence Theorem Diagram then EX is simple. Moreover, we study cases where EX is an elementary class. We introduce the notion of semigenericity and show that if a K0,-semigeneric structure exists then EX is an elementary class and therefore the -theory of K0,-generic is near model complete. By this result we are able to give a new proof for a theorem of Baldwin and Shelah 1359). We conclude this paper by giving an example of a generic structure whose first-order theory is simple. (shrink)

We study smooth classes without the algebraic closure property. For such smooth classes we investigate the simplicity of the class of generic structures, in the context of Robinson theories.

Let${\cal F}$=(F; +,.,0, 1, D) be a differentially closed field. We consider the question of definability of the derivation D in reducts of${\cal F}$of the form${\cal F}$R= (F; +,.,0, 1,P)PεRwhereRis some collection of definable sets in${\cal F}$. We give examples and nonexamples and establish some criteria for definability of D. Finally, using the tools developed in the article, we prove that under the assumption of inductiveness of Th (${\cal F}$R) model completeness is a necessary condition for definability of D. This (...) can be seen as part of a broader project where one is interested in finding Ax-Schanuel type inequalities (or predimension inequalities) for differential equations. (shrink)

We give an exposition of Hrushovskiʼs New Strongly Minimal Set : A strongly minimal theory which is not locally modular but does not interpret an infinite field. We give an exposition of his construction.

Countable homogeneous relational structures have been studied by many people. One area of focus is the Ramsey theory of such structures. After a review of background material, a partition theorem of Laflamme, Sauer, and Vuksanovic for countable homogeneous binary relational structures is discussed with a focus on the size of the set of unavoidable colors.

This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excellence, which is a key to the structure theory of uncountable models. The notion of Abstract Elementary Class arose naturally in attempting to prove the categoricity theorem for L ω 1 ,ω (Q). More recently, Zilber has attempted to identify canonical mathematical structures as those whose theory (in an appropriate logic) (...) is categorical in all powers. Zilber's trichotomy conjecture for first order categorical structures was refuted by Hrushovski, by the introducion of a special kind of Abstract Elementary Class. Zilber uses a powerful and essentailly infinitary variant on these techniques to investigate complex exponentiation. This not only demonstrates the relevance of Shelah's model theoretic investigations to mainstream mathematics but produces new results and conjectures in algebraic geometry. (shrink)

A linear space is a system of points and lines such that any two distinct points determine a unique line; a Steiner k-system is a linear space such that each line has size exactly k. Clearly, as a two-sorted structure, no linear space can be strongly minimal. We formulate linear spaces in a vocabulary $\tau $ with a single ternary relation R. We prove that for every integer k there exist $2^{\aleph _0}$ -many integer valued functions $\mu $ such that (...) each $\mu $ determines a distinct strongly minimal Steiner k-system $\mathcal {G}_\mu $, whose algebraic closure geometry has all the properties of the ab initio Hrushovski construction. Thus each is a counterexample to the Zilber Trichotomy Conjecture. (shrink)

The objective of this article is to characterise elimination of finite generalised imaginaries as defined in [9] in terms of group cohomology. As an application, I consider series of Zariski geometries constructed [10, 23, 24] by Hrushovski and Zilber and indicate how their nondefinability in algebraically closed fields is connected to eliminability of certain generalised imaginaries.

We propose a criterion to regard a property of a theory (in first or second order logic) as virtuous: the property must have significant mathematical consequences for the theory (or its models). We then rehearse results of Ajtai, Marek, Magidor, H. Friedman and Solovay to argue that for second order logic, ‘categoricity’ has little virtue. For first order logic, categoricity is trivial; but ‘categoricity in power’ has enormous structural consequences for any of the theories satisfying it. The stability hierarchy extends (...) this virtue to other complete theories. The interaction of model theory and traditional mathematics is examined by considering the views of such as Bourbaki, Hrushovski, Kazhdan, and Shelah to flesh out the argument that the main impact of formal methods on mathematics is using formal definability to obtain results in ‘mainstream’ mathematics. Moreover, these methods (e.g., the stability hierarchy) provide an organization for much mathematics which gives specific content to dreams of Bourbaki about the architecture of mathematics. (shrink)

Non-$n$-ampleness as defined by Pillay [20] and Evans [5] is preserved under analysability. Generalizing this to a more general notion of $\Sigma$-ampleness, this gives an immediate proof for all simple theories of a weakened version of the Canonical Base Property (CBP) proven by Chatzidakis [4] for types of finite SU-rank. This is then applied to the special case of groups.

The projective plane of Baldwin 695) is model complete in a language with additional constant symbols. The infinite rank bicolored field of Poizat 1339) is not model complete. The finite rank bicolored fields of Baldwin and Holland 371; Notre Dame J. Formal Logic , to appear) are model complete. More generally, the finite rank expansions of a strongly minimal set obtained by adding a ‘random’ unary predicate are almost strongly minimal and model complete provided the strongly minimal set is ‘well-behaved’ (...) and admits ‘exactly rank k formulas’. The last notion is a geometric condition on strongly minimal sets formalized in this paper. (shrink)

In the present paper we shall prove that countable ω-categorical simple CM-trivial theories and countable ω-categorical simple theories with strong stable forking are low. In addition, we observe that simple theories of bounded finite weight are low.

We show that the free pseudospace is a reduct of a 1-based theory. This answers a question of David M. Evans. The theory is superstable, but not ω-stable.

An amalgamation base p in a simple theory is stably definable if its canonical base is interdefinable with the set of canonical parameters for the ϕ-definitions of p as ϕ ranges through all stable formulae. A necessary condition for stably definability is given and used to produce an example of a supersimple theory with stable forking having types that are not stably definable. This answers negatively a question posed in [8]. A criterion for and example of a stably definable amalgamation (...) base whose restriction to the canonical base is not axiomatised by stable formulae are also given. The examples involve generic relations over non CM-trivial stable theories. (shrink)