Environment v4.30.0. The archive's epoch is v4.33.0; only submissions in v4.30.0 can cite this work.
Proof of `Polynomial-time evaluation of fixed-point queries`
groundedproofs/Lax979537Proofs/FixedPointEvaluation.lean · lax-979537
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 concrete finite TM2 decodes the input, evaluates the fixed formula by materialized relation-table iteration, rejects malformed strings, and returns one Boolean after clearing its workspace and resetting control.