 Logics like \(\FO(\LFP)\) can be recast as logics of the form \(\FO(Q_1,Q_2,\ldots)\). Here infinitely many quantifiers may be required, but in some cases a single one suffices. As to \(\FO(\LFP)\), it suffices to add all the resumptions (see the end of  section 5  above) of a single quantifier. More generally, let \(\FO^*(Q_1,Q_2,\ldots)\) be like \(\FO(Q_1,Q_2,\ldots)\) but with mechanisms for making relativizations  (section 7)  and for resuming each \(Q_i\) to k-tuples for each k. Then there is a single quantifier Q such that \(\FO(\LFP) = \FO^*(Q)\).