Extends modal logic with a bisimulation modality, proves definability via frame correspondence, gives a sound complete axiomatization for bisimilar model pairs, and reduces satisfiability to K with PSPACE-completeness, all verified in Isabelle/HOL.
Time and modality
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A meta-modal logic for bisimulations
Extends modal logic with a bisimulation modality, proves definability via frame correspondence, gives a sound complete axiomatization for bisimilar model pairs, and reduces satisfiability to K with PSPACE-completeness, all verified in Isabelle/HOL.