We examine the conditions under which we can keep simplicity or categoricity after adding a Skolem function to the theory.

We show that every reduct of a stable. CM-trivial theory of finite U-rank is CM-trivial.

For each k > 0 we construct an algebraic structure over which the polynomial hierarchy collapses at level k. We also find an algebraic structure over which the polynomial hierarchy does not collapse.