Is there any result about the extension of first order logic with least fixed point operator, being complete (as logic in general on infinite structures too) or not? In other words does the Goedel completeness theorem of first order logic extent to such FO-LFP logic ?

  • $\begingroup$ If you can't get an answer here, I would try the TCS stack-exchange, it deals with research level questions, which I would possibly qualify this as. But there's a good chance someone here will know. $\endgroup$
    – jmite
    Jun 16 '14 at 3:36
  • $\begingroup$ Thank you! I do put now the same question in TCS stack-exchange $\endgroup$
    – DrkCostas
    Jun 16 '14 at 4:59
  • $\begingroup$ Hmm, make sure you only have it on one site at a time, as there's a policy against crossposting. I'd reccomend you delete the post here and leave it on TCS, they'll tell you if it's not suitable for there. Sorry for the confusion! $\endgroup$
    – jmite
    Jun 16 '14 at 5:54
  • $\begingroup$ Apparently, the respective question on TCS is this: cstheory.stackexchange.com/questions/24906/… IMHO it does have some good answers. $\endgroup$
    – kne
    Jul 29 '18 at 10:50

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.