Talk:SO (complexity)

This redirect does not require a rating on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Mathematics Low‑priority This redirect is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks. Low This redirect has been rated as Low-priority on the project's priority scale. Computer science This redirect is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks. Things you can help WikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Untitled

Latest comment: 15 years ago1 comment1 person in discussion

Since they were "First Order" I added "second order" but i don't know if it's good or not. Every remarks I had to do are in the Discussion page of FO Arthur MILCHIOR (talk) 08:09, 8 June 2010 (UTC)Reply

Add reference for claim that Every SO formula is Equivalent to Prenex Form.

Latest comment: 10 years ago1 comment1 person in discussion

I do not recall the source of this statement in literature. It would be good to add a reference for it. (FWIW, I believe the statement to be correct).

2602:306:3489:9890:38D2:4B14:421D:8C6C (talk) 20:19, 26 February 2015 (UTC)Reply

Almost impenetrable, even for someone versed in FO complexity

Latest comment: 9 years ago1 comment1 person in discussion

This article is in serious need of attention. Ross Fraser (talk) 00:11, 16 October 2015 (UTC)Reply

Can we rename it and/or merge with Second-Order Logic

I believe it would be good to rename it because SO is too cryptic. "Complexity of Second-Order Logic" and redirect from SO_(complexity) would be an example of an appropriate entry.

Also, so that people are not misled that this solves P vs NP question, the precise statement of the satisfiability and the role of the ordering relation should be clarified.