Type-count bounds for monadically dependent classes

Prove that the near-linear type-count bound for first-order formulas extends from monadically stable classes to monadically dependent classes.

Background

The paper states that monadically stable classes satisfy strong bounds on the number of realized types over finite parameter sets. It further records a conjecture that an analogous result holds for monadically dependent classes, with some special cases already known.