DocumentCode
2195553
Title
Expressive equivalence of least and inflationary fixed-point logic
Author
Kreutzer, Stephan
Author_Institution
LuFG Mathematische Grundlagen der Informatik, Rheinisch-Westfalische Tech. Hochschule, Aachen, Germany
fYear
2002
fDate
2002
Firstpage
403
Lastpage
410
Abstract
We study the relationship between least and inflationary fixed-point logic. By results of Gurevich and Shelah (1986), it has been known that on finite structures both 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 still open. In this paper, we settle the question by showing that both logics are equally expressive on arbitrary structures. The proof will also establish the strictness of the nesting-depth hierarchy for IFP on some infinite structures. Finally, we show that the alternation hierarchy for IFP collapses to the first level on all structures, i.e. the complement of an inflationary fixed-point is an inflationary fixed-point itself.
Keywords
equivalence classes; formal logic; expressive equivalence; expressive power; finite structures; inflationary fixed-point logic; least fixed-point logic; nesting-depth hierarchy; Arithmetic; Artificial intelligence; Calculus; Computational complexity; Computer science; Database languages; History; Logic; Polynomials; Relational databases;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 2002. Proceedings. 17th Annual IEEE Symposium on
ISSN
1043-6871
Print_ISBN
0-7695-1483-9
Type
conf
DOI
10.1109/LICS.2002.1029848
Filename
1029848
Link To Document