 The method can be explained by means of a simple example taken from Carnielli et al. 2008: consider a propositional modal logic \({{\cal L}}\), to be parameterized with first-order logic \({{\cal L}}_{fol}\) in order to describe the dynamics of data bases. The resulting logic is defined in a language whose formulas are obtained by replacing propositional constants in formulas of \({{\cal L}}\) by first-order formulas. That is, modalities can be freely used, but quantifiers cannot be applied to modal formulas (other propositional connectives such as negation and implication are shared).