The P versus NP problem is addressed in a context of provability and limitations on the possibility of finding sound axioms for formal theories. It is shown that if the term "constructible theory" is defined in a way which satisfies certain natural conditions, then no constructible, arithmetically sound and formalizable theory proves P = NP.

翻译：P对NP问题在可证明性以及寻找形式理论可靠公理的可能局限性这一背景下被探讨。研究表明，如果以满足某些自然条件的方式定义术语“可构造理论”，那么不存在可构造、算术可靠且可形式化的理论能够证明P = NP。