Unprovability of P = NP in PV
Statement
Let be a polynomial-time algorithm, viewed as a function symbol of , and let
where expresses that satisfies the Boolean formula encoded by . Unprovability conjecture. For no polynomial-time algorithm does theory prove the sentence . This is a formal weakening of the conjecture that : if , the equality should nevertheless not be provable using only polynomial-time concepts and reasoning. By standard conservation results, the claim is also equivalent to consistency of and with in the intended sense.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.