Search

We look into methods which make it possible to determine whether or not the modal logics under examination are residually finite w.r.t. admissible inference rules. A general condition is specified which states that modal logics over K4 are not residually finite w.r.t. admissibility. It is shown that all modal logics λ over K4 of width strictly more than 2 which have the co-covering property fail to be residually finite w.r.t. admissible inference rules; in particular, such are K4, GL, K4.1, K4.2, S4.1, S4.2, and GL.2. It is proved that all logics λ over S4 of width at most 2, which are not sublogics of three special table logics, possess the property of being residually finite w.r.t. admissibility. A number of open questions are set up.

Independent bases of admissible inference rules are studied; namely, we treat inference rules in pretable modal logics over S4, and in pretable superintuitionistic logics. The Maksimova-Esakia-Meskhi theorem holds that there exist exactly five pretable S4-logics and precisely three pretable superintuitionistic ones. We argue that all pretable modal logics and all pretable super-intuitionistic logics have independent bases for admissible inference rules.