While this submission is a draft, it cannot be used by other submissions.

Proof of `A computable finite-model bound under bisimulation invariance` (1st statement)

groundedproofs/Lax369799Proofs/QuantitativeFiniteTheorem.lean · lax-369799

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Apply quantitative recognition and clone normalization, retaining every finite bound. The encoding and bisimulation theorems identify the modal game with the original MSO sentence on every finite reachable system.