We extend the dichotomy between 1-basedness and supersimplicity proved in Shami :309–332, 2011). The generalization we get is to arbitrary language, with no restrictions on the topology [we do not demand type-definabilty of the open set in the definition of essential 1-basedness from Shami :309–332, 2011)]. We conclude that every hypersimple unidimensional theory that is not s-essentially 1-based by means of the forking topology is supersimple. We also obtain a strong version of the above dichotomy in the case where the (...) language is countable. (shrink)

We define a reasonably well-behaved class of ultraimaginaries, i.e. classes modulo [Formula: see text]-invariant equivalence relations, called tame, and establish some basic simplicity-theoretic facts. We also show feeble elimination of supersimple ultraimaginaries: If [Formula: see text] is an ultraimaginary definable over a tuple [Formula: see text] with [Formula: see text], then [Formula: see text] is eliminable up to rank [Formula: see text]. Finally, we prove some uniform versions of the weak canonical base property.

We prove that has no proper superstable expansions of finite Lascar rank. Nevertheless, this structure equipped with a predicate defining powers of a given natural number is superstable of Lascar rank ω. Additionally, our methods yield other superstable expansions such as equipped with the set of factorial elements.