Modal Logics Between Propositional and First-order

From MaRDI portal





In this paper, relation symbols and terms without quantifiers are added to propositional modal logics. The result is, in a sense, an intermediate logic between propositional logic and first-order logic. The goal of the paper is the study of decidability of logics which contain \textbf{K}, \textbf{D}, \textbf{T}, \textbf{B}, \textbf{K4} or \textbf{S5} as a basis. Since the semantics allows terms to be non-rigid, ambiguity results. To avoid this problem, a mechanism based on lambda abstraction is introduced. Let's suppose that \textbf{L} is a propositional modal logic. We consider \textbf{L}\(\lambda\) to be the logic that results from adding to the alphabet of the language of \textbf{L} a stock of relation symbols, constant symbols and abstraction (but not quantifiers). On the other hand, \textbf{L}\(\lambda_=\) is the logic whose alphabet adds to the alphabet of \textbf{L}\(\lambda\) the equality relation. From a semantic point of view, the semantics of \textbf{L}\(\lambda\) extends that of \textbf{L} by adding a domain in which to interpret constant and relation symbols, and it is the same from world to world. However, constant and relation symbols will be allowed to be interpreted non-rigidily. Stated this, the main theorem of the paper establishes the following: If \textbf{L} is one of \textbf{K}, \textbf{D}, \textbf{T}, \textbf{B}, then \textbf{L}\(\lambda\) and \textbf{L}\(\lambda_=\) are decidable. \textbf{S5}\(\lambda_=\) is undecidable, and if \textbf{L} is between \textbf{K4} and \textbf{S5}, then \textbf{L}\(\lambda_=\) is undecidable too.











This page was built for publication: Modal Logics Between Propositional and First-order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796461)