Proof of `Computable bounds for MSO recognizing algebras`
groundedproofs/Lax369799Proofs/QuantitativeRecognition.lean · lax-369799
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
Track the finite carrier sizes in the recognition induction. Atomic path summaries have at most 2^(4(k+1)) values in sort k. Disjunction multiplies bounds, existential quantification takes a powerset, and inverse relabelling preserves the bound. The bound is computed directly from the input syntax.