We study model theoretic tree properties and their associated cardinal invariants. In particular, we obtain a quantitative refinement of Shelah’s theorem for countable theories, show that [Formula: see text] is always witnessed by a formula in a single variable and that weak [Formula: see text] is equivalent to [Formula: see text]. Besides, we give a characterization of [Formula: see text] via a version of independent amalgamation of types and apply this criterion to verify that some examples in the literature are (...) indeed [Formula: see text]. (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 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)