Post's correspondence problem is RE-complete
Lax624099.PcpREComplete · concepts/Lax624099/PcpREComplete.lean · lax-624099
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
PCP is RE-complete: a match is recognized by guessing it in existential second-order logic with value invention, and the halting problem reduces to PCP by an ordered first-order reduction, the computation-history dominoes.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
Show Proof
Builds on
Used by
none
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments