The semantic definition of NP is unsatisfiable because it forces languages where truth-in-L coincides with bounded provability, violating Gödel's First Incompleteness Theorem.
Some consequences of cryptographical conjectures forS1 2 and EF.Information and Computation, 140(1):82–94
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
On Formally Undecidable Propositions of Nondeterministic Complexity and Related Classes
The semantic definition of NP is unsatisfiable because it forces languages where truth-in-L coincides with bounded provability, violating Gödel's First Incompleteness Theorem.