Kripke models for modal logic #
A Kripke model for modal logic over a finite world-type W and an
atom-type Atom: an accessibility relation R : W → Finset W together
with a Boolean valuation V : Atom → W → Bool. This is the standard
Kripke structure used as the carrier for classical modal logic and
its team-semantic extensions (BSML, MDL, modal inclusion logic, etc.).
The Finset form of accessibility (rather than Set or a binary
relation) reflects the decidable / finite-witness use case shared by
the modal team-semantic logics — all current consumers (BSML, QBSML,
the AAY-2024 extensions BSMLOr/BSMLEmpty, modal dependence logic in
Core/Logic/Modal/Dependence.lean) consume this finite form.
Main declarations #
KripkeModel W Atom— the carrier structure: accessibility (access)- valuation (
val).
- valuation (
Consumers #
Core/Logic/Modal/BSML/Defs.lean—BSMLModelis anabbrevof this type.Core/Logic/Modal/QBSML/Defs.lean—QBSMLModelparameterises this carrier with an assignment type.Core/Logic/Modal/Dependence.lean— modal dependence logic (MDL).Studies/AloniAnttilaYang2024.lean— BSMLOr, BSMLEmpty (viaBSMLModelalias).
Todo #
- Lift bisimulation infrastructure currently at
Core/Logic/Modal/BSML/Bisimulation.leanto a siblingCore/Logic/Modal/Bisimulation.leanonce a non-BSML consumer (MDL bisim invariance, modal inclusion logic) lands.
A Kripke model over world-type W and atom-type Atom:
an accessibility relation access : W → Finset W (mapping each
world to its set of successors) together with a Boolean valuation
val : Atom → W → Bool (mapping each atom to its truth value at
each world).
The universe of worlds is given by [Fintype W] — use Finset.univ
for the full set. Decidable equality on W is required so that
accessibility images are well-behaved as Finsets.
- access : W → Finset W
Accessibility:
access wis the set of worlds accessible fromw. - val : Atom → W → Bool
Valuation:
val p wis the truth value of atompat worldw.