Sciweavers

APAL
2004

Expressive equivalence of least and inflationary fixed-point logic

14 years 14 days ago
Expressive equivalence of least and inflationary fixed-point logic
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.
Stephan Kreutzer
Added 16 Dec 2010
Updated 16 Dec 2010
Type Journal
Year 2004
Where APAL
Authors Stephan Kreutzer
Comments (0)