PhilArchive
open access
P≠NP: A Semantic Context Argument
I have solved P vs NP. If NP requires a certificate AND a context then the verification of NP (and the solution) violates the formal constraints of NP. Verification itself is a self-referential assertion of truth that shows NP≠NP, thus N≠NP.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- P versus NP problem solution#103475
- Assertion and convention#737536
- P vs NP: A Proof of Unprovability Through Contextual Self-Reference#95111
- You gotta believe#774125
- Well Founded Justification Trees in Proof Theoretic Semantics applied to the Liar Paradox and the Halting Problem Input#733597
Record · ID 75884
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive