Proving P!=NP in first-order PA release_x2j2grmz5nasnj4pemmcld3awm

by Rupert McCallum

Released as a article .

2020  

Abstract

We show that it is provable in PA that there is an arithmetically definable sequence {ϕ_n:n ∈ω} of Π^0_2-sentences, such that - PRA+{ϕ_n:n ∈ω} is Π^0_2-sound and Π^0_1-complete - the length of ϕ_n is bounded above by a polynomial function of n with positive leading coefficient - PRA+ϕ_n+1 always proves 1-consistency of PRA+ϕ_n. One has that the growth in logical strength is in some sense "as fast as possible", manifested in the fact that the total general recursive functions whose totality is asserted by the true Π^0_2-sentences in the sequence are cofinal growth-rate-wise in the set of all total general recursive functions. We then develop an argument which makes use of a sequence of sentences constructed by an application of the diagonal lemma, which are generalisations in a broad sense of Hugh Woodin's "Tower of Hanoi" construction as outlined in his essay "Tower of Hanoi" in Chapter 18 of the anthology "Truth in Mathematics". The argument establishes the result that it is provable in PA that P ≠ NP.
In text/plain format

Archived Files and Locations

application/pdf  134.8 kB
file_ee7jro4mbndw7fmpz3qfek2j6q
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2020-06-08
Version   v4
Language   en ?
arXiv  2005.10080v4
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: ed2ca3f7-cecc-4033-9f43-47b314c8a3cc
API URL: JSON