Proof of `Mortality reduces to positive first-order definability`
groundedproofs/Lax503819Proofs/ComputableReduction.lean · lax-503819
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
Section 6 and Remark 6.25: the explicit compiler is primitive recursive, and the positive-game arguments establish its mortality equivalence.