[FOM] Least Fixed Point Logic

[Robert Lubarsky]

How is LFPL related to the mu-calculus? I have an (unpublished) article showing that the set of valid sentences of the mu-calculus is Sigma^1_2 complete.

 

Bob Lubarsky

 

From: fom-bounces at cs.nyu.edu [mailto:fom-bounces at cs.nyu.edu] On Behalf Of Sandro Skansi
Sent: Saturday, November 23, 2013 5:34 PM
To: Foundations of Mathematics
Subject: [FOM] Least Fixed Point Logic

 

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

-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20131125/c3301ca5/attachment.html>