On the Expressive Power of Logics on Finite Models

Abstract: Structures" [Mos74], where they are called inductiverelations. It should also be pointed out that in Immerman's book on "Descriptive Complexity"LFP is denoted by FO(LFP) (the closure of FO under least fixed-points) and LFP 1 is denoted byLFP(FO) (least fixed-points of first-order formulas).