Let G be a group definable in an o-minimal structure M. In this paper we show: Theorem. If G is a two-dimensional definably connected nonabelian group, then G is centerless and G is isomorphic to R+R*>0, for some real closed field R. Theorem. If G is a three-dimensional nonsolvable, centerless, definably connected group, then either G SO3 or G PSL2, for some real closed field R.

We define the notion of Euler characteristic for definable quotients in an arbitrary o-minimal structure and prove some fundamental properties.

The class of geometric surgical theories is examined. The main theorem is that every stable theory that is interpretable in a geometric surgical theory is superstable of finite U-rank.

We prove that in an arbitrary o-minimal structure, every interpretable group is definably isomorphic to a definable one. We also prove that every definable group lives in a cartesian product of one-dimensional definable group-intervals. We discuss the general open question of elimination of imaginaries in an o-minimal structure.

Let \ be an expansion of a real closed field \ by a dense subgroup G of \ with the Mann property. We prove that the induced structure on G by \ eliminates imaginaries. As a consequence, every small set X definable in \ can be definably embedded into some \, uniformly in parameters. These results are proved in a more general setting, where \ is an expansion of an o-minimal structure \ by a dense set \, satisfying three tameness (...) conditions. (shrink)

This paper was motivated by the following two questions which arise in the theory of complexity for computation over ordered rings in the now famous computational model introduced by Blum, Shub and Smale: 1. is the answer to the question P = ?NP the same in every real-closed field?2. if P ≠ NP for , does there exist a problem of which is NP but neither P nor NP-complete ?Some unclassical complexity classes arise naturally in the study of these questions. (...) They are still open, but we could obtain unconditional results of independent interest.Michaux introduced/const complexity classes in an effort to attack question . We show that , answering a question of his. Here A is the class of real problems which are algorithmic in bounded time. We also prove the stronger result: , where PAR stands for parallel polynomial time. In our terminology, we say that is A-saturated and PAR-saturated. We also prove, at the nonuniform level, the above results for every real-closed field. It is not known whether is P-saturated. In the case of the reals with addition and order we obtain P-saturation ). More generally, we show that an ordered -vector space is P-saturated at the nonuniform level ).We also study a stronger notion that we call P-stability. Blum, Cucker, Shub and Smale have shown that fields of characteristic 0 are P-stable. We show that the reals with addition and order are P-stable, but real-closed fields are not.Questions and and the/const complexity classes have some model theoretic flavor. This leads to the theory of complexity over “arbitrary” structures as introduced by Poizat. We give a summary of this theory with a special emphasis on the connections with model theory and we study/const complexity classes from this point of view. Note also that our proof of the PAR-saturation of shows that an o-minimal structure which admits quantifier elimination is A-saturated at the nonuniform level. (shrink)

We study structures equipped with generic predicates and/or automorphisms, and show that in many cases we obtain simple theories. We also show that a bounded PAC field is simple. 1998 Published by Elsevier Science B.V. All rights reserved.

We study the degree of elimination of imaginaries needed for the three main applications: to have canonical bases for types over models, to define strong types as types over algebraically closed sets and to have a Galois correspondence between definably closed sets B such that A ⊆ B ⊆ acl and closed subgroups of the Galois group Aut/A). We also characterize when the topology of the Galois group is the quotient topology.

A totally ordered group G is called coset-minimal if every definable subset of G is a finite union of cosets of definable subgroups intersected with intervals with endpoints in G{±∞}. Continuing work in Belegradek et al. 1115) and Point and Wagner 261), we study coset-minimality, as well as two weak versions of the notion: eventual and ultimate coset-minimality. These groups are abelian; an eventually coset-minimal group, as a pure ordered group, is an ordered abelian group of finite regular rank. Any (...) pure ordered abelian group of finite regular rank is ultimately coset-minimal and has the exchange property; moreover, every definable function in such a group is piecewise linear. Pure coset-minimal and eventually coset-minimal groups are classified. In a discrete coset-minimal group every definable unary function is piece-wise linear 261), where coset-minimality of the theory of the group was required). A dense coset-minimal group has the exchange property ); moreover, any definable unary function is piecewise linear, except possibly for finitely many cosets of the smallest definable convex nonzero subgroup. Finally, we give some examples and open questions. (shrink)