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

Proof of `MSO-definable languages are algebraically recognisable`

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

Translate vertex variables into singleton-valued set variables. Finite path algebras recognize the atomic formulas; products, complement, and nonempty powerset algebras implement the logical operations. A sentence has no free marks, which are removed by inverse relabelling.