On Modal Logics Characterized by Models with Relative Accessibility Relations: Part II
Source: Studia Logica, Volume 66, Number 3, December 2000 , pp. 349-384(36)
Abstract:This work is divided in two papers (Part I and Part II). In Part I, we introduced the class of Rare-logics for which the set of terms indexing the modal operators are hierarchized in two levels: the set of Boolean terms and the set of terms built upon the set of Boolean terms. By investigating different algebraic properties satisfied by the models of the Rare-logics, reductions for decidability were established by faithfully translating the Rare-logics into more standard modal logics (some of them contain the universal modal operator).
In Part II, we push forward the results from Part I. For Rare-logics with nominals (present at the level of formulae and at the level of modal expressions), we show that the constructions from Part I can be extended although it is technically more involved. We also characterize a class of standard modal logics for which the universal modal operator can be eliminated as far as satifiability is concerned. Although the previous results have a semantic flavour, we are also able to define proof systems for Rare-logics from existing proof systems for the corresponding standard modal logics. Last, but not least, decidability results for Rare-logics are established uniformly, in particular for information logics derived from rough set theory.
Since this paper is the continuation of Part I, we do not recall here the definitions of Part I although we refer to them.
Document Type: Regular Paper
Affiliations: 1: Lab. Spécification et Vérification CNRS, UMR 8643 ENS de Cachan 61, av. du Président Wilson 94235 Cachan Cedex, France firstname.lastname@example.org 2: King's College STRAND London WC2R 2LS, United Kingdom email@example.com
Publication date: December 2000