We assume a theory T in the logic is categorical in a cardinal λ κ, and κ is a measurable cardinal. We prove that the class of models of T of cardinality < λ (but ≥ |T|+κ) has the amalgamation property; this is a step toward understanding the character of such classes of models.
This is a sequel to [1]. Here we give careful attention to the difficulties of calculating Morley and U-rank of the infinite rank ω-stable theories constructed by variants of Hrushovski's methods. Sample result: For every k < ω, there is an ω-stable expansion of any algebraically closed field which has Morley rank ω × k. We include a corrected proof of the lemma in [1] establishing that the generic model is ω-saturated in the rank 2 case.
We continue the work of Shelah and Casanovas on the cardinality of families of pairwise inconsistent types in simple theories. We prove that, in a simple theory, there are at most pairwise inconsistent types of size μ over a set of size λ. This bound improves the previous bounds and clarifies the role of κ(T). We also compute exactly the maximal cardinality of such families for countable, simple theories. The main tool is the fact that, in simple theories, the collection of nonforking extensions...