We observe that every first-order logic formula over the untyped versi
on of some many-sorted vocabulary is equivalent to a union of many-sor
ted formulas over that vocabulary. This result has as direct corollary
a theorem by Hull and Su on the expressive power of active-domain qua
ntification in the relational calculus.