A contradiction and P=NP problem

Abstract

Here, by introducing a version of “Unexpected hanging paradox” first we try to open a new way and a new explanation for paradoxes, similar to liar paradox. Also, we will show that we have a semantic situation which no syntactical logical system could support it. Finally, we propose a claim in Theory of Computation about the consistency of this Theory. One of the major claim is:Theory of Computation and Classical Logic leads us to a contradiction.

Author's Profile

Farzad Didehvar
Amir Kabir University University (Tehran Polytechnic)

Analytics

Added to PP
2015-09-29

Downloads
464 (#31,125)

6 months
53 (#70,638)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?