Proof of `Bisimulation-invariant MSO on finite graphs` (2nd statement)
groundedproofs/Lax369799Proofs/MainTheorems.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
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.