PRP0105canonicalv1P vs NP as Polynomial Translation Obstruction
P vs NP = polynomial translation obstruction. succinct_circuits has damage 3 (bridge breaks). Internal P_adm = NP_adm (all finite problems decidable) but cannot be translated to ZFC. Verified at depth 3.
Payload
P vs NP as Polynomial Translation Obstruction
P vs NP = polynomial translation obstruction. succinct_circuits has damage 3 (bridge breaks). Internal P_adm = NP_adm (all finite problems decidable) but cannot be translated to ZFC. Verified at depth 3.
P vs NP as Polynomial Translation Obstruction
Summary
P vs NP = polynomial translation obstruction. succinct_circuits has damage 3 (bridge breaks). Internal P_adm = NP_adm (all finite problems decidable) but cannot be translated to ZFC. Verified at depth 3.
Statement
No manuscript statement was extracted in this pilot run.
Proof / Justification
No immediate manuscript proof block was extracted in this pilot run.
Source Context
- Registry source:
book-03.jsonlline 237 - Manuscript source: not matched
Lean / Formalization Notes
- Formalization:
formalized - Module:
TauLib.BookIII.Bridge.TranslationObstruction - Name:
pvsnp_obstruction_3
Dependencies
- Canonical: III.T61
Related Results
Generated by later projection phases.
Related Publications
Generated by later projection phases.
Revision Notes
- 2026-04-24: Initial pilot migration.
Identifiers
Aliases & legacy IDs
III.P38p-vs-np-as-polynomial-translation-obstructionprop:pvsnp-obstructionRelease lines
corpus_v3_workingcorpus_v2Relations
Formalized by (1)
Appears in (1)
Downstream uses (computed) (2)
Items in the corpus that reference this one via load-bearing relations. Computed from the full corpus-v3 graph at build time.
Sources
Version & History
Status disclaimer
A Corpus Item page reports the program's current internal record for this item. It does not imply external verification, scientific consensus, or final proof unless explicitly stated. Read it together with its dependencies, formalization status, and the program's overall stance.