uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Verifying that P is not equal to NP using a theorem prover
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  in propositional logic is satisfiable is not  in P .  Therefore, P  is not  equal  to  NP .  In the first- order theory B, axiomatizing Turing’s theory of computing, three versions of the proofs  are  presented.  First, an  informal  (conceptual)  proof  about formal  proofs.    Second,  a  more  formal  proof  in  Hilbert’s  proof  theory. Third, a formal  proof in Hilbert’s proof theory, using  a theorem prover.

Place, publisher, year, edition, pages
Uppsala: Department of Informatics and Media , 2013. , 36 p.
Research report / Uppsala University, Department of Information Science, ISSN 1403-7572 ; 2013:2
Keyword [en]
P is not equal to NP, theorem prover
National Category
Information Systems, Social aspects
Research subject
Computer Systems Sciences
URN: urn:nbn:se:uu:diva-207452OAI: oai:DiVA.org:uu-207452DiVA: diva2:648241
Available from: 2013-09-13 Created: 2013-09-13 Last updated: 2013-12-12Bibliographically approved

Open Access in DiVA

Tärnlund rapport IM1302(1070 kB)155 downloads
File information
File name FULLTEXT01.pdfFile size 1070 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links


Search in DiVA

By author/editor
Tärnlund, Sten-Åke
By organisation
Information Systems
Information Systems, Social aspects

Search outside of DiVA

GoogleGoogle Scholar
Total: 155 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: 562 hits
ReferencesLink to record
Permanent link

Direct link