[FOM] Least Fixed Point Logic

[John Baldwin]

Ebbinghaus and Flum, Finite Model Theory

John T. Baldwin
Professor Emeritus
Department of Mathematics, Statistics,
and Computer Science M/C 249
jbaldwin at uic.edu
851 S. Morgan
Chicago IL
60607


On Sat, Nov 23, 2013 at 4:34 PM, Sandro Skansi <skansi.sandro at gmail.com>wrote:

> Dear FOMers,
>
> Can anyone please give me some pointers on where to find more on the least
> fixed point logic (FO(LFP), LFPL)? I am particularly interested in proof
> systems for LFPL (as well as general articles on LFPL, including
> completness/incompletness proofs (is it complete?)), but I was not able to
> locate any articles dealing with this system, and the description in
> Immerman's Descriptive Complexity is quite brief and a bit informal for my
> needs.
>
> Thank you all in advance,
>
> Sandro
>
> _______________________________________________
> FOM mailing list
> FOM at cs.nyu.edu
> http://www.cs.nyu.edu/mailman/listinfo/fom
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20131124/c0e6715e/attachment.html>