On modal logics characterized by models with relative accessibility relations. I (Q1591337)

The paper is the first part of a larger work on polynomial modal logics with relative accessibility relations (rare-logics). Information logics [see, e.g., \textit{E. Orłowska}, ``Information algebras'', Lect. Notes Comput. Sci. 936, 50-65 (1995) and \textit{B. Konikowska}, Stud. Log. 58, 185-226 (1997; Zbl 0874.03020)] are examples of rare-logics. In the present paper rare-logics are studied in a uniform and general way. The main result is that there exist satisfiability-preserving transformations between rare-logics from a large class and the corresponding standard modal logics. As a consequence, under some conditions, a rare-logic is decidable, has fmp or sfpsp iff its corresponding standard modal logic has the same properties, respectively.