arXiv:math/0404205 [math.LO]AbstractReferencesReviewsResources
FPL may be equivalent to FO but not equivalent to PFP
Published 2004-04-09Version 1
Given a class of finite models we would like to expand each model (allowing new elements but the old universe is a separate sort), making the expressive power of LFP (least fix point logic) and PFP (inductive logic) similar while not changing the expressive power of FO (first order logic). This continues in math.LO/9411235.
Categories: math.LO
Related articles: Most relevant | Search more
arXiv:1209.3562 [math.LO] (Published 2012-09-17)
Knots, Braids and First Order Logic
arXiv:1511.05221 [math.LO] (Published 2015-11-16)
Weak Godel's incompleteness property for some decidable versions of first order logic
arXiv:1605.03501 [math.LO] (Published 2016-05-11)
Is Leibnizian calculus embeddable in first order logic?