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.

Our investigation is concerned with the finite model property (fmp) with respect to admissible rules. We establish general sufficient conditions for absence of fmp w. r. t. admissibility which are applicable to modal logics containing K4: Theorem 3.1 says that no logic λ containing K4 with the co-cover property and of width > 2 has fmp w. r. t. admissibility. Surprisingly many, if not to say all, important modal logics of width > 2 are within the scope of this theorem–K4 itself, S4, GL, K4.1, K4.2, S4.1, S4.2, GL.2, etc. Thus the situation is completely opposite to the case of the ordinary fmp–the absolute majority of important logics have fmp, but not with respect to admissibility. As regards logics of width ≤ 2, there exists a zone for fmp w. r. t. admissibility. It is shown (Theorem 4.3) that all modal logics A of width ≤ 2 extending S4 which are not sub-logics of three special tabular logics (which is equipotent to all these λ extend a certain subframe logic defined over S4 by omission of four special frames) have fmp w.r.t. admissibility.