Abstract We study the relationship between least and inflationary fixed-point logic. In 1986, Gurevich and Shelah proved that in the restriction to finite structures, the two logics have the same expressive power. On infinite structures however, the question whether there is a formula in IFP not equivalent to any LFP-formula was left open. In this paper, we answer the question negatively, i.e. we show that the two logics are equally expressive on arbitrary structures. We give a syntactic translation of IFP-formulae to LFP-formulae such that the two formulae are equivalent on all structures. As a consequence of the proof we establish a close correspondence between the LFP-alternation hierarchy and the IFP-nesting depth hierarchy. We also show that the alternation hierarchy for IFP collapses to the first level, i.e. the complement of any inflationary fixed point is itself an inflationary fixed point.
[1]
Peter Aczel,et al.
An Introduction to Inductive Definitions
,
1977
.
[2]
Neil Immerman,et al.
Relational Queries Computable in Polynomial Time
,
1986,
Inf. Control..
[3]
Saharon Shelah,et al.
Fixed-point extensions of first-order logic
,
1985,
26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[4]
Jörg Flum,et al.
Finite model theory
,
1995,
Perspectives in Mathematical Logic.
[5]
Anuj Dawar,et al.
Fixed point logics
,
2002,
Bull. Symb. Log..
[6]
Stephan Kreutzer.
Expressive equivalence of least and inflationary fixed-point logic
,
2002,
Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.
[7]
Yiannis N. Moschovakis,et al.
Elementary induction on abstract structures
,
1974
.