Graded modal logic and counting bisimulation
Logic
2023-07-19 v2 Logic in Computer Science
Abstract
This note sketches the extension of the basic characterisation theorems as the bisimulation-invariant fragment of first-order logic to modal logic with graded modalities and matching adaptation of bisimulation. We focus on showing expressive completeness of graded multi-modal logic for those first-order properties of pointed Kripke structures that are preserved under counting bisimulation equivalence among all or among just all finite pointed Kripke structures.
Cite
@article{arxiv.1910.00039,
title = {Graded modal logic and counting bisimulation},
author = {Martin Otto},
journal= {arXiv preprint arXiv:1910.00039},
year = {2023}
}
Comments
(minor revision 2023)