FMP-Ensuring Logics, RA-Ensuring Logics and FA-Ensuring Logics in $\text {NExtK4.3}$

Abstract

This paper studies modal logics whose extensions all have the finite model property, those whose extensions are all recursively axiomatizable, and those whose extensions are all finitely axiomatizable. We call such logics FMP-ensuring, RA-ensuring and FA-ensuring respectively, and prove necessary and sufficient conditions of such logics in $\mathsf {NExtK4.3}$. Two infinite descending chains $\{{\textbf{S}}_{k}\}_{k\in \omega }$ and $\{{\textbf{S}} _{k}^{*}\}_{k\in \omega }$ of logics are presented, in terms of which the necessary and sufficient conditions are formulated as follows: A logic in $\mathsf {NExtK4.3}$ is FMP-ensuring iff it extends ${\textbf{S}}_{k}$ for some $k\in \omega$, it is RA-ensuring iff it extends ${\textbf{S}}_{k}^{*}$ for some $k\in \omega$, and it is FA-ensuring iff it is finitely axiomatizable and extends ${\textbf{S}}_{k}^{*}$ for some $k\in \omega$.