Proof of `RE is recursive enumerability`
groundedproofs/Lax624099Proofs/Bridge.lean · lax-624099
What this proof establishes
no assumptions
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
The library's identification of definability with value invention and recursive enumerability of the concrete instances, through code halting in both directions.