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

Proof of `Bisimulation-invariant MSO on finite graphs` (2nd statement)

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

Encode finite transition systems as ranked systems, apply MSO recognition and the algebraic modal translation, and decode. The converse combines the standard MSO translation with bisimulation invariance of the mu-calculus.