David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 65 (3):323-353 (2000)
This work is divided in two papers (Part I and Part II). In Part I, we study a class of polymodal logics (herein called 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 are established by faithfully translating the Rare-logics into more standard modal logics. The main idea of the translation consists in eliminating the Boolean terms by taking advantage of the components construction and in using various properties of the classes of semilattices involved in the semantics. The novelty of our approach allows us to prove new decidability results (presented in Part II), in particular for information logics derived from rough set theory and we open new perspectives to define proof systems for such logics (presented also in Part II).
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Melvin Fitting, Lars Thalmann & Andrei Voronkov (2001). Term-Modal Logics. Studia Logica 69 (1):133-169.
D. M. Gabbay (1996). Fibred Semantics and the Weaving of Logics Part 1: Modal and Intuitionistic Logics. Journal of Symbolic Logic 61 (4):1057-1120.
Stéphane Demri & Rajeev Goré (2000). Display Calculi for Logics with Relative Accessibility Relations. Journal of Logic, Language and Information 9 (2):213-236.
Marcus Kracht & Frank Wolter (1997). Simulation and Transfer Results in Modal Logic – a Survey. Studia Logica 59 (2):149-177.
Kosta Došen (1985). Models for Stronger Normal Intuitionistic Modal Logics. Studia Logica 44 (1):39 - 70.
Stéphane Demri & Ewa Orłowska (1999). Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of ♦-Formulae. Studia Logica 62 (2):177 - 200.
Added to index2009-01-28
Total downloads7 ( #149,786 of 1,089,047 )
Recent downloads (6 months)1 ( #69,722 of 1,089,047 )
How can I increase my downloads?