A computable finite-model bound under bisimulation invariance
Lax369799.QuantitativeFiniteTheorem · concepts/Lax369799/QuantitativeFiniteTheorem.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
The quantitative construction of Theorem 2 gives a bounded modal certificate. Its small-model property provides a syntax-computed bound for every nonempty bisimulation-invariant MSO sentence on finite systems.
Concept map
Evidence
This concept declares 2 statements. Each proof establishes one of them relative to its assumptions.
1 modal_certificate proven
2 nonempty_bound proven
Lean source view on GitHub
Show ProofShow Proof
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments