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

MSO translation and bisimulation invariance of the mu-calculus

Lax369799.MuCalculusTheorems · concepts/Lax369799/MuCalculusTheorems.lean · lax-369799

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Theorem

    Every modal mu-calculus sentence has an equivalent MSO sentence, and its truth is preserved by bisimulation. These standard results supply the reverse implication of the main theorem. The semantic monotonicity lemma justifies the fixed-point clauses of the mu-calculus semantics.

    Concept map
    5 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    This concept declares 3 statements. Each proof establishes one of them relative to its assumptions.

    Lean source view on GitHub

    1import Lax369799.MonadicSecondOrder
    2import Lax369799.ModalMuCalculus
    3
    4/-!
    5---
    6title: MSO translation and bisimulation invariance of the mu-calculus
    7type: theorem
    8---
    9Every modal mu-calculus sentence has an equivalent MSO sentence, and its
    10truth is preserved by bisimulation. These standard results supply the
    11reverse implication of the main theorem. The semantic monotonicity lemma
    12justifies the fixed-point clauses of the mu-calculus semantics.
    13-/
    14
    15namespace Lax369799.MuCalculusTheorems
    16open TransitionSystems
    17
    18axiom eval_monotone {P : Type} (S : TransitionSystem P) {n : ℕ}
    19 (φ : ModalMuCalculus.Formula P n) (ρ σ : Fin n → Set S.Vertex)
    20 (h : ∀ i, ρ i ⊆ σ i) : φ.eval S ρ ⊆ φ.eval S σ
    21
    22axiom mu_to_mso {P : Type} (φ : ModalMuCalculus.Sentence P) :
    23 ∃ ψ : MonadicSecondOrder.Sentence P, ∀ S,
    24 ModalMuCalculus.Models S φ ↔ MonadicSecondOrder.Models S ψ
    25
    26axiom mu_bisimulation_invariant {P : Type} (φ : ModalMuCalculus.Sentence P) :
    27 BisimulationInvariant {S | ModalMuCalculus.Models S φ}
    28
    29end Lax369799.MuCalculusTheorems
    30
    Show ProofShow ProofShow Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…