tag:blogger.com,1999:blog-12932458.post112939479306288003..comments2023-09-29T09:03:36.236-05:00Comments on Logicomp: An approach to prove P != NPanthonywlinhttp://www.blogger.com/profile/07618509800342861247noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-12932458.post-1129606155175785512005-10-17T22:29:00.000-05:002005-10-17T22:29:00.000-05:00Thanks for your considered reply!Thanks for your considered reply!Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-12932458.post-1129506814087081892005-10-16T18:53:00.000-05:002005-10-16T18:53:00.000-05:00David: sure. The next post will be on this issue. ...David: sure. The next post will be on this issue. However, if you are impatient, just check out Graedel's tutorial on descriptive complexity, which you can find at http://www.cis.upenn.edu/~weinstein/fmta.html.<BR/><BR/>Alternatively, you may look at either Libkin's Element of Finite Model Theory book or Immerman's Descriptive Complexity book. [Look for the notion of a logic "capturing" a complexity class.]anthonywlinhttps://www.blogger.com/profile/07618509800342861247noreply@blogger.comtag:blogger.com,1999:blog-12932458.post-1129500389242417092005-10-16T17:06:00.000-05:002005-10-16T17:06:00.000-05:00Can you talk a little more about what it means to ...Can you talk a little more about what it means to have a logic on an ordered vs. an unordered structure? or point to a suitable reference?Anonymousnoreply@blogger.com