Switch to: References

Citations of:

Uniform Interpolation for Monotone Modal Logic

In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 350-370 (1998)

Add citations

You must login to add citations.
  1. Model Theoretical Aspects of Weakly Aggregative Modal Logic.Jixin Liu, Yifeng Ding & Yanjing Wang - 2022 - Journal of Logic, Language and Information 31 (2):261-286.
    Weakly Aggregative Modal Logic ) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. \ has interesting applications on epistemic logic, deontic logic, and the logic of belief. In this paper, we study some basic model theoretical aspects of \. Specifically, we first give a van Benthem–Rosen characterization theorem of \ based on an intuitive notion of bisimulation. Then, in contrast to many well known normal or non-normal modal logics, we show that (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Weakly Aggregative Modal Logic: Characterization and Interpolation.Jixin Liu, Yanjing Wang & Yifeng Ding - 2019 - In Patrick Blackburn, Emiliano Lorini & Meiyun Guo (eds.), Logic, Rationality, and Interaction 7th International Workshop, LORI 2019, Chongqing, China, October 18–21, 2019, Proceedings. Springer. pp. 153-167.
    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 Kn lacks Craig Interpolation.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The succinctness of the cover modality.H. Van Ditmarsch & P. Iliev - 2015 - Journal of Applied Non-Classical Logics 25 (4):373-405.
    We prove that modal logic formulated in a language with the cover modality is exponentially more succinct than the usual box-and-diamond version. In contrast with this, we show that adding the so-called public announcement operator to the latter results in a modal system that is exponentially more succinct than the one based on the cover modality.
    Download  
     
    Export citation  
     
    Bookmark   2 citations