Weakly Aggregative Modal Logic: Characterization and Interpolation

Add code
Oct 06, 2018
Jixin Liu, Yanjing Wang

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon

In this paper, we study the model theoretical aspects of Weakly Aggregative Modal Logic (WAL), which is a collection of disguised polyadic modal logics with $n$-ary modalities whose arguments are all the same. We give a van-Benthem-Rosen characterization theorem of WAL based on an intuitive notion of bisimulation, and show that WAL has Craig Interpolation.

* There is a flaw in the proof of the interpolation theorem of this paper (Many thanks to an anonymous reviewer of AiML2018 for pointing it out). Unfortunately, WAL does not have Craig Interpolation, and we found counterexamples for all WAL_n  
View paper onarxiv icon

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon