A Sufficient Condition for the Consistency of P=NP with Peano Arithmetic
Wojciech Kowalczyk · Fundamenta Informaticae · 1982
In this paper we show how the indicators technique due to Paris and Kirby may be used to obtain independence or consistency results in Computer Science. We give an example of a sentence which is independent of PA and we formulate a sufficient condition for the consistency of P=NP with Peano Arithmetic.