Studia Logica 66 (3):349-384 (2000)
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.
|Keywords||Philosophy Logic Mathematical Logic and Foundations Computational Linguistics|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Completeness and Decidability Results for Some Propositional Modal Logics Containing “Actually” Operators.Dominic Gregory - 2001 - Journal of Philosophical Logic 30 (1):57-78.
Simulation and Transfer Results in Modal Logic – a Survey.Marcus Kracht & Frank Wolter - 1997 - Studia Logica 59 (2):149-177.
Models for Stronger Normal Intuitionistic Modal Logics.Kosta Došen - 1985 - Studia Logica 44 (1):39 - 70.
Fibred Semantics and the Weaving of Logics Part 1: Modal and Intuitionistic Logics.D. M. Gabbay - 1996 - Journal of Symbolic Logic 61 (4):1057-1120.
Term-Modal Logics.Melvin Fitting, Lars Thalmann & Andrei Voronkov - 2001 - Studia Logica 69 (1):133-169.
Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of ♦-Formulae.Stéphane Demri & Ewa Orłowska - 1999 - Studia Logica 62 (2):177 - 200.
On Modal Logics Characterized by Models with Relative Accessibility Relations: Part I.Stéphane Demri & Dov Gabbay - 2000 - Studia Logica 65 (3):323-353.
Added to index2009-01-28
Total downloads12 ( #362,835 of 2,146,264 )
Recent downloads (6 months)1 ( #386,503 of 2,146,264 )
How can I increase my downloads?
There are no threads in this forum
Nothing in this forum yet.