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

Proof of `Executable bounded comparison of MSO and modal formulas`

groundedproofs/Lax369799Proofs/FiniteTesting.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 closure-set test detects exactly the reachable graph codes. Complete finite table enumeration and the two verified model checkers identify the Boolean test with agreement on all finite systems within the bound.