DocumentCode
2183638
Title
Fixed-point extensions of first-order logic
Author
Gurevich, Yuri ; Shelah, Saharon
fYear
1985
fDate
21-23 Oct. 1985
Firstpage
346
Lastpage
353
Abstract
We prove that the three extensions of first-order logic by means of positive inductions, monotone inductions, and so-called non-monotone (in our terminology, inflationary) inductions respectively, all have the same expressive power in the case of finite structures. As a by-product, the collapse of the corresponding fixed-point hierarchies can be deduced.
Keywords
Books; Calculus; Computer languages; Computer science; Database languages; Gold; Logic programming; Mathematics; Power engineering computing; Terminology;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1985., 26th Annual Symposium on
Conference_Location
Portland, OR, USA
ISSN
0272-5428
Print_ISBN
0-8186-0644-4
Type
conf
DOI
10.1109/SFCS.1985.27
Filename
4568160
Link To Document