Proof of `Code halting is RE-complete`
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
Membership from the library's definition of code halting with value invention; hardness because finite satisfiability, recursively enumerable on concrete instances, reduces to code halting by the library's ordered reduction, and is RE-hard by this submission's statement.