On Finite Model Property for Admissible Rules

Abstract

Our investigation is concerned with the finite model property (fmp) with respect to admissible rules. We establish general sufficient conditions for absence of frnp w. I. t. admissibility which are applicable to modal logics containing K4: Theorem 3.1 says that no logic X containing K4 with the co-cover property and of width > 2 has fmp w. I. 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 5 2, there exists a zone for fmp w. r. t. admissibility. It is shown (Theorem 4.3) that all modal logics X of width 5 2 extending S4 which are not sub-logics of three special tabular logics (which is equipotent to all these X extend a certain subframe logic defined over S4 by omission of four special frames) have fmp w. I. t. admissibility.Mathematics Subject Classification: 03B45, 03F07.

Decidability of Admissibility: On a Problem by Friedman and Its Solution by Rybakov

“…Rules, however, are not. We refer to Fedorishin and Ivanov (2003) and Goudsmit (2016) for a full argument on this and point to Rybakov, Kiyatkin, and Oner (1999) for an argument in the modal case. In the next section, we inspect a weakening of the notion of exactness that can be safely restricted to the finite.…”

Hereditarily Structurally Complete Superintuitionistic Deductive Systems

“…In [12, Section 3.6] Goudsmit presented some classes of superintuitionistic logics that do not have the a-fmp. The normal modal logics with and without the a-fmp are studied in [25,26].…”

Finite Frames Fail: How Infinity Works Its Way into the Semantics of Admissibility

“…Rybakov, Kiyatkin and Oner [18] proved the failure of the finite model property for admissible rules in a great variety of modal logics, including K4, S4 and GL. Moreover, they describe conditions under which the finite model property for admissible rules does hold.…”