Skip to main content
Article thumbnail
Location of Repository

1.1 Background

By 

Abstract

We present a plausible, purely combinatorial Ramsey-style sentence CS that infers, in Peano Arithmetic, the negative solution (abbr.: P < N P) to the fa-miliar open problem P? = N P. Validity of CS is briefly discussed; it will be elaborated and presented in more detail elsewhere. This work is both a simplified and extended version of [G04]. The simplification, due to A. Krebs, says that what was called the proper normal case in [G04] is in fact sufficient for P < N P (see Theorem 27 in the text)

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.7873
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www-ls.informatik.uni-t... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.