Axiomatization of Logics Based on Kripke Models with Relative Accessibility Relations
Philippe Balbiani · Studies in fuzziness and soft computing · 1998
This paper presents a systematic study of the logics based on Kripke models with relative accessibility relations as well as a general method for proving their completeness. The Kripke models with relative accessibility relations come out in the context of the analysis of indiscernability in the information systems. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.