We show that infinite sets whose power-sets are Dedekind-finite can only carry N₀-categorical first order structures. We identify other subclasses of this class of Dedekind-finite sets, and discuss their possible first order structures.

Let T be superstable. We say a type p is weakly minimal if R(p, L, ∞) = 1. Let $M \models T$ be uncountable and saturated, H = p(M). We say $D \subset H$ is locally modular if for all $X, Y \subset D$ with $X = \operatorname{acl}(X) \cap D, Y = \operatorname{acl}(Y) \cap D$ and $X \cap Y \neq \varnothing$ , dim(X ∪ Y) + dim(X ∩ Y) = dim(X) + dim(Y). Theorem 1. Let p ∈ S(A) be weakly (...) minimal and D the realizations of $\operatorname{stp}(a/A)$ for some a realizing p. Then D is locally modular or p has Morley rank 1. Theorem 2. Let H, G be definable over some finite A, weakly minimal, locally modular and nonorthogonal. Then for all $a \in H\backslash\operatorname{acl}(A), b \in G\operatorname{acl}(A)$ there are a' ∈ H, b' ∈ G such that $a' \in \operatorname{acl}(abb' A)\backslash\operatorname{acl}(aA)$ . Similarly when H and G are the realizations of complete types or strong types over A. (shrink)

We construct a new class of 1 categorical structures, disproving Zilber's conjecture, and study some of their properties.

A set is said to be amorphous if it is infinite, but is not the disjoint union of two infinite subsets. Thus amorphous sets can exist only if the axiom of choice is false. We give a general study of the structure which an amorphous set can carry, with the object of eventually obtaining a complete classification. The principal types of amorphous set we distinguish are the following: amorphous sets not of projective type, either bounded or unbounded size of members (...) of partitions of the set into finite pieces), and amorphous sets of projective type, meaning that the set admits a non-degenerate pregeometry, over finite fields either of bounded cardinality or of unbounded cardinality. The hope is that all amorphous sets will be of one of these types. Examples of each sort are constructed, and a reconstruction result for bounded amorphous sets is presented, indicating that the amorphous sets of this kind constructed in the paper are the only possible ones. The final section examines some questions concerned with the resulting cardinal arithmetic. (shrink)

This paper studies some model-theoretic properties of special groups of finite type. Special groups are a first-order axiomatization of the algebraic theory of quadratic forms, introduced by Dickmann and Miraglia, which is essentially equivalent to abstract Witt rings. More precisely, we consider elementary equivalence, saturation, elementary embeddings, quantifier elimination, stability and Morley rank.

It is shown that no infinite group is interpretable in any structure which is homogeneous in a finite relational language. Related questions are discussed for other ω-categorical structures.

§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)

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)

We generalize the result of non-finite axiomatizability of totally categorical first-order theories from elementary model theory to homogeneous model theory. In particular, we lift the theory of envelopes to homogeneous model theory and develope theory of imaginaries in the case of ω-stable homogeneous classes of finite U-rank.

We show that if G is a strongly minimal finitely axiomatizable group, the division ring of quasi-endomorphisms of G must be an infinite finitely presented ring.

We are concerned with identifying by how much a finite cover of an 0-categorical structure differs from a sequence of free covers. The main results show that this is measured by automorphism groups which are nilpotent-by-abelian. In the language of covers, these results say that every finite cover can be decomposed naturally into linked, superlinked and free covers. The superlinked covers arise from covers over a different base, and to describe this properly we introduce the notion of a quasi-cover.These results (...) generalise results of the second author obtained in the case where the base of the cover is a grassmannian of a disintegrated set. They also give a complete proof of a statement of the second author extending this case to the case of a grassmannian of a modular set. To do this, we need to analyse the possible superlinked covers of such a set.We also give a combinatorial condition on the base of a cover which guarantees various chain conditions on finite covers over this base, and introduce a pregeometry which is useful in the analysis of finite covers with simple fibre groups. (shrink)

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.

In [R. Vaught, Denumerable models of complete theories, in: Infinitistic Methods, Pregamon, London, 1961, pp. 303–321] Vaught conjectured that a countable first order theory has countably many or 20 many countable models. Here, the following special case is proved.

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)

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)

Hrushovski constructed an -categorical stable pseudoplane which refuted Lachlan's conjecture. In this note, we show that an -categorical projective plane cannot be constructed by "the Hrushovski method.".

We construct a type p with preweight ω with respect to itself in a theory with few types. A type with this property must be present in a stable theory with finitely many (but more than one) countable models. The construction is a modification of Hrushovski's important pseudoplane construction.

We define the interpolative fusion T∪∗ of a family i∈I of first-order theories over a common reduct T∩, a notion that generalizes many examples of random or generic structures in the model-theo...

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.

The model theoretic `back and forth' construction of isomorphisms and automorphisms is based on the proof by Cantor that the theory of dense linear orderings without endpoints is ℵ 0 -categorical. However, Cantor's method is slightly different and for many other structures it yields an injection which is not surjective. The purpose here is to examine Cantor's method (here called `going forth') and to determine when it works and when it fails. Partial answers to this question are found, extending those (...) earlier given by Cameron. We also give fuller characterisations of when forth suffices for model theoretic classes such as structures containing Jordan sets for the automorphism group, and ℵ 0 -categorical ω-stable structures. The work is based on the author's Ph.D. thesis. (shrink)

In connection with the work of Anscombe, Macpherson, Steinhorn and the present author in [1] we investigate the notion of a multidimensional exact class (R-mec), a special kind of multidimensional asymptotic class (R-mac) with measuring functions that yield the exact sizes of definable sets, not just approximations. We use results about smooth approximation [24] and Lie coordinatization [13] to prove the following result (Theorem 4.6.4), as conjectured by Macpherson: For any countable language$\mathcal {L}$and any positive integerdthe class$\mathcal {C}(\mathcal {L},d)$of all (...) finite$\mathcal {L}$-structures with at mostd4-types is a polynomial exact class in$\mathcal {L}$, where a polynomial exact class is a multidimensional exact class with polynomial measuring functions. (shrink)

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)

For each k 1, let Γk be the countable universal homogeneous k-hypergraph. In this paper, we shall classify the closed permutation groups G such that Aut G Sym. In particular, we shall show that there exist only finitely many such groups G for each k 1. We shall also show that each of the associated reducts of Γk is homogeneous with respect to a finite relational language.

I see model theory as becoming increasingly detached from set theory, and the Tarskian notion of set-theoretic model being no longer central to model theory. In much of modern mathematics, the set-theoretic component is of minor interest, and basic notions are geometric or category-theoretic. In algebraic geometry, schemes or algebraic spaces are the basic notions, with the older “sets of points in affine or projective space” no more than restrictive special cases. The basic notions may be given sheaf-theoretically, or functorially. (...) To understand in depth the historically important affine cases, one does best to work with more general schemes. The resulting relativization and “transfer of structure” is incomparably more flexible and powerful than anything yet known in “set-theoretic model theory”.It seems to me now uncontroversial to see the fine structure of definitions as becoming the central concern of model theory, to the extent that one can easily imagine the subject being called “Definability Theory” in the near future.Tarski's set-theoretic foundational formulations are still favoured by the majority of model-theorists, and evolution towards a more suggestive language has been perplexingly slow. None of the main texts uses in any nontrivial way the language of category theory, far less sheaf theory or topos theory. Given that the most notable interactions of model theory with geometry are in areas of geometry where the language of sheaves is almost indispensable, this is a curious situation, and I find it hard to imagine that it will not change soon, and rapidly. (shrink)

By a celebrated theorem of Morley, a theory T is ℵ1‐categorical if and only if it is κ‐categorical for all uncountable κ. In this paper we are taking the first steps towards extending Morley's categoricity theorem “to the finite”. In more detail, we are presenting conditions, implying that certain finite subsets of certain ℵ1‐categorical T have at most one n‐element model for each natural number (counting up to isomorphism, of course).

Model theory is concerned mainly, although not exclusively, with infinite structures. In recent years, finite structures have risen to greater prominence, both within the context of mainstream model theory, e.g., in work of Lachlan, Cherlin, Hrushovski, and others, and with the advent of finite model theory, which incorporates elements of classical model theory, combinatorics, and complexity theory. The purpose of this survey is to provide an overview of what might be called the model theory of finite structures. Some topics in (...) finite model theory have strong connections to theoretical computer science, especially descriptive complexity theory. In fact, it has been suggested that finite model theory really is, or should be, logic for computer science. These connections with computer science will, however, not be treated here.It is well-known that many classical results of ‘infinite model theory’ fail over the class of finite structures, including the compactness and completeness theorems, as well as many preservation and interpolation theorems. The failure of compactness in the finite, in particular, means that the standard proofs of many theorems are no longer valid in this context. At present, there is no known example of a classical theorem that remains true over finite structures, yet must be proved by substantially different methods. It is generally concluded that first-order logic is ‘badly behaved’ over finite structures.From the perspective of expressive power, first-order logic also behaves badly: it is both too weak and too strong. Too weak because many natural properties, such as the size of a structure being even or a graph being connected, cannot be defined by a single sentence. Too strong, because every class of finite structures with a finite signature can be defined by an infinite set of sentences. Even worse, every finite structure is defined up to isomorphism by a single sentence. In fact, it is perhaps because of this last point more than anything else that model theorists have not been very interested in finite structures. Modern model theory is concerned largely with complete first-order theories, which are completely trivial here. (shrink)

We study the Vapnik–Chervonenkis density of definable families in certain stable first-order theories. In particular, we obtain uniform bounds on the VC density of definable families in finite $\mathrm {U}$-rank theories without the finite cover property, and we characterize those abelian groups for which there exist uniform bounds on the VC density of definable families.

We prove that if T is a stable theory with only a finite number 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.

Suppose T is a weakly minimal theory and p a strong 1-type having locally finite but nontrivial geometry. That is, for any M [boxvR] T and finite Fp, there is a finite Gp such that acl∩p = gεGacl∩pM; however, we cannot always choose G = F. Then there are formulas θ and E so that θεp and for any M[boxvR]T, E defines an equivalence relation with finite classes on θ/E definably inherits the structure of either a projective or affine space (...) over some finite field. We then specify what other structure θ/E may inherit: there is some collection of definable subspaces of finite codimension and some set of algebraic points, which in the affine case may be in the canonically associated vector space, Up to acl, no further structure is possible. If we assume T is weakly minimal and has a strong type p as above, and also that T is unidimensional, we obtain a global description of any model of T in terms of those structures mentioned in the previous paragraph. (shrink)

We consider a small supersimple theory with a property (CS) (close to stability). We prove that if in such a theoryTthere is a typep∈S(A) (whereAis finite) withSU(p) = 1 and infinitely many extensions overacleq(A), then inTthere is a modular such type. Also, ifTis supersimple with (CS) andp∈S(∅) is isolated,SU(p) = 1 andphas infinitely many extensions overacleq(∅), thenpis modular.

We prove, by a probabilistic argument, that a class of ω-categorical structures, on which algebraic closure defines a pregeometry, has the finite submodel property. This class includes any expansion of a pure set or of a vector space, projective space or affine space over a finite field such that the new relations are sufficiently independent of each other and over the original structure. In particular, the random graph belongs to this class, since it is a sufficiently independent expansion of an (...) infinite set, with no structure. The class also contains structures for which the pregeometry given by algebraic closure is non-trivial. (shrink)

Let V be a finite relational vocabulary in which no symbol has arity greater than 2. Let be countable V‐structure which is homogeneous, simple and 1‐based. The first main result says that if is, in addition, primitive, then it is strongly interpretable in a random structure. The second main result, which generalizes the first, implies (without the assumption on primitivity) that if is “coordinatized” by a set with SU‐rank 1 and there is no definable (without parameters) nontrivial equivalence relation on (...) M with only finite classes, then is strongly interpretable in a random structure. (shrink)