Constructibility and the P versus NP problem
Abstract
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, and we assume that every true sentence in the language of Peano Arithmetic is provable in some sound and constructible theory, then no sound and constructible theory proves P = NP.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.