Proof of `Post's correspondence problem is undecidable`
groundedproofs/Lax624099Proofs/Bridge.lean · lax-624099
What this proof establishes
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
Post's correspondence problem is RE-hard, and every RE-hard problem is undecidable.