Proof of `Uniform word-RAM model checking for intrinsic MSO sentences`
groundedproofs/Lax842588Proofs/IntrinsicUniformModelChecking.lean · lax-842588
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 formula compiler is executed within the counted run. The checked embedding into includes the terminal instruction in that count. Parameter-only computable envelopes cover its resources, the linear tree evaluator, and the finite layout's machine addresses. Lax560851's reusable predicate hides the expanded program and sufficient-width quantifiers without weakening them.