We observe simple links between equivalence relations, groups, fields and groupoids (and between preorders, semi-groups, rings and categories), which are type-definable in an arbitrary structure, and apply these observations to the particular context of small and simple structures. Recall that a structure is small if it has countably many n-types with no parameters for each natural number n. We show that a θ-type-definable group in a small structure is the conjunction of definable groups, and extend the result to semi-groups, fields, (...) rings, categories, groupoids and preorders which are θ-type-definable in a small structure. For an A-type-definable group G A (where the set A may be infinite) in a small and simple structure, we deduce that (1) if G A is included in some definable set X such that boundedly many translates of G A cover X, then G A is the conjunction of definable groups. (2) for any finite tuple ḡ in G A , there is a definable group containing ḡ. (shrink)

Under [Formula: see text]-amalgamation, we obtain the canonical hyperdefinable group from the group configuration.

The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.

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

We initiate a geometric stability study of groups of the form G/G00, where G is a 1-dimensional definably compact, definably connected, definable group in a real closed field M. We consider an enriched structure M′ with a predicate for G00 and check 1-basedness or non-1-basedness for G/G00, where G is an additive truncation of M, a multiplicative truncation of M, SO2(M) or one of its truncations; such groups G/G00 are now interpretable in M′. We prove that the only 1-based groups (...) are those where G is a sufficiently “big” multiplicative truncation, and we relate the results obtained to valuation theory. In the last section we extend our results to ind-hyperdefinable groups constructed from those above. (shrink)

We show that the N₀-categorical structures produced by Hrushovski's predimension construction with a control function fit neatly into Shelah's $SOP_n $ hierarchy: if they are not simple, then they have SOP₃ and NSOP₄. We also show that structures produced without using a control function can be undecidable and have SOP.

We study the groups Gal L and Gal KP, and the associated equivalence relations EL and EKP, attached to a first order theory T. An example is given where EL≠ EKP. It is proved that EKP is the composition of EL and the closure of EL. Other examples are given showing this is best possible.

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.

§1. Introduction. With Hrushovski's proof of the function field Mordell-Lang conjecture [16] the relevance of geometric stability theory to diophantine geometry first came to light. A gulf between logicians and number theorists allowed for contradictory reactions. It has been asserted that Hrushovski's proof was simply an algebraic argument masked in the language of model theory. Another camp held that this theorem was merely a clever one-off. Still others regarded the argument as magical and asked whether such sorcery could unlock the (...) secrets of a wide coterie of number theoretic problems.In the intervening years each of these prejudices has been revealed as false though such attitudes are still common. The methods pioneered in [16] have been extended and applied to a number of other problems. At their best, these methods have been integrated into the general methods for solving diophantine problems. Moreover, the newer work suggests limits to the application of model theory to diophantine geometry. For example, all such known applications are connected with commutative algebraic groups. This need not be an intrinsic restriction, but its removal requires serious advances in the model theory of fields. (shrink)

We show that under Martin's Axiom, the cofinality cf(Aut(Γ)) of the automorphism group of the random graph Γ is 2 ω.

A lattice L is coordinatizable, if it is isomorphic to the lattice L of principal right ideals of some von Neumann regular ring R. This forces L to be complemented modular. All known sufficient conditions for coordinatizability, due first to von Neumann, then to Jónsson, are first-order. Nevertheless, we prove that coordinatizability of lattices is not first-order, by finding a non-coordinatizable lattice K with a coordinatizable countable elementary extension L. This solves a 1960 problem of Jónsson. We also prove that (...) there is no [Formula: see text] statement equivalent to coordinatizability. Furthermore, the class of coordinatizable lattices is not closed under countable directed unions; this solves another problem of Jónsson from 1962. (shrink)