Change search
ReferencesLink to record
Permanent link

Direct link
P is not equal to NP
Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Social Sciences, Department of Informatics and Media, Information Systems.
2013 (English)Report (Other academic)
Abstract [en]

The problem of computing whether any formula of propositional logic is satisfiable is not in P. Therefore, P is not equal to NP. The proofs are informal about formal proofs in a first-order theory B axiomatizing Turing’s theory of computing. However, the informal proofs can be converted into formal proofs in Hilbert’s proof theory, and proved using a theorem prover.

Place, publisher, year, edition, pages
Uppsala: Department of Informatics and media , 2013. , 7 p.
Research report / Uppsala University, Department of Information Science, ISSN 1403-7572 ; 2013:5
National Category
Computer and Information Science
URN: urn:nbn:se:uu:diva-208283OAI: diva2:651748

This report is an updated version of a report with the same title published in 2008. (See

Available from: 2013-09-27 Created: 2013-09-27 Last updated: 2013-11-13Bibliographically approved

Open Access in DiVA

fulltext(719 kB)239 downloads
File information
File name FULLTEXT02.pdfFile size 719 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Tärnlund, Sten-Åke
By organisation
Information Systems
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 282 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 687 hits
ReferencesLink to record
Permanent link

Direct link