Weakly Aggregative Modal Logic: Characterization and Interpolation (new version)
This work addresses foundational issues in modal logic for applications in knowledge representation and game theory, but it is incremental as it builds on existing WAML frameworks.
The paper tackles the characterization and interpolation properties of Weakly Aggregative Modal Logic (WAML), a polyadic modal logic with applications in epistemic logic and game theory, by proving a van Benthem-Rosen characterization theorem and showing that the basic system K_n lacks Craig Interpolation.
Weakly Aggregative Modal Logic (WAML) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. WAML has some interesting applications on epistemic logic and logic of games, so we study some basic model theoretical aspects of WAML in this paper. Specifically, we give a van Benthem-Rosen characterization theorem of WAML based on an intuitive notion of bisimulation and show that each basic WAML system K_n lacks Craig Interpolation.