We prove that if M0 is a model of a simple theory, and p(x) is a complete type of Cantor–Bendixon rank 1 over M0, then p is stationary and regular. As a consequence we obtain another proof that any countable model M0 of a countable complete simple theory T has infinitely many countable elementary extensions up to M0-isomorphism. The latter extends earlier results of the author in the stable case, and is a special case of a recent result of Tanovic.

We establish an identification result of the projective special linear group of dimension 2among a certain class of groups the Morley rank of which is finite.

This paper is a brief survey of recent results and some open problems related to linear groups of finite Morley rank, an area of research where Bruno Poizat's impact is very prominent. As a sign of respect to his strongly expressed views that mathematics has to be done, written and pulished only in the native tongue of the immediate author–the scribe, in effect–of the text, I insist on writing my paper in Russian, even if the results presented belong to a small but multilingual community of researchers of American, British, French, German, Kazakh, Russian, Turkish origin. To emphasise even further the linguistic subtleties involved, I use British spelling in the English fragments of my text.

We construct a bad field in characteristic zero. That is, we construct an algebraically closed field which carries a notion of dimension analogous to Zariski-dimension, with an infinite proper multiplicative subgroup of dimension one, and such that the field itself has dimension two. This answers a longstanding open question by Zilber.

Countable homogeneous models are ‘simple’ objects from a model theoretic point of view. From a recursion theoretic point of view they can be complex. For instance the elementary theory of such a model might be undecidable, or the set of complete types might be recursively complex. Unfortunately even if neither of these conditions holds, such a model still can be undecidable. This paper investigates countable homogeneous models with respect to a weaker notion of decidability called almost decidable. It is shown that for theories that have only countably many type spectra, any countable homogeneous model of such a theory that has a Σ2 type spectrum is almost decidable.

It is shown that no functor F exists from the category of sets with injections, to the category of algebraically closed fields of given characteristic, with monomorphisms, having the properties that for all sets A. F(A) is an algebraically closed field having transcendence base A and for all injections f. F(f) extends f. There does exist such a functor from the category of linearly-ordered sets with order monomorphisms.

An application to model-theory using the same methods is given showing that while the theory of algebraically closed fields is ω-stable, its Skolemization is not stable in any power.

In Section 1 below I describe two measures of the complexity of a binary relation. J The theorem says that these two measures never disagree very much. Both measures of complexity arose in connection with Saharon Shelah's notion [5] of a stable firstt order theory; Shelah showed in effect that one measure is finite, if, and only if, the other is finite too. This follows trivially from the theorem below. I confess my main aim was not to get the extra information which the theorem provides, but to eliminate Shelah's use of uncountable cardinals, which seemed strangely heavy machinery for proving a purely finitary result. Section 2 below explains the modeltheoretic setting.