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

Proof of `Effective translation of bisimulation-invariant finite MSO`

groundedproofs/Lax369799Proofs/EffectiveFiniteTranslation.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.

Read the Lean proof on GitHub

Description

The syntactic translation on arbitrary structures specializes to the finite semantics, providing the effective reverse direction of Theorem 2.