The decidable normal modal logics are not recursively enumerable

1985 ◽  
Vol 14 (3) ◽  
Author(s):  
M.J. Cresswell
Keyword(s):  
Modal Logics ◽  
Recursively Enumerable ◽  
Normal Modal Logics

scholarly journals Fusions of Description Logics and Abstract Description Systems

2002 ◽  
Vol 16 ◽  
pp. 1-58 ◽  
Author(s):  
F. Baader ◽  
C. Lutz ◽  
H. Sturm ◽  
F. Wolter
Keyword(s):  
Large Class ◽  
Description Logics ◽  
General Setting ◽  
Modal Logics ◽  
Common Generalization ◽  
Abstract Description ◽  
Normal Modal Logics ◽  
Combining Logics

Fusions are a simple way of combining logics. For normal modal logics, fusions have been investigated in detail. In particular, it is known that, under certain conditions, decidability transfers from the component logics to their fusion. Though description logics are closely related to modal logics, they are not necessarily normal. In addition, ABox reasoning in description logics is not covered by the results from modal logics. In this paper, we extend the decidability transfer results from normal modal logics to a large class of description logics. To cover different description logics in a uniform way, we introduce abstract description systems, which can be seen as a common generalization of description and modal logics, and show the transfer results in this general setting.

Modal sequents for normal modal logics

1993 ◽  
Vol 39 (1) ◽  
pp. 231-240 ◽  
Author(s):  
Claudio Cerrato
Keyword(s):  
Modal Logics ◽  
Normal Modal Logics

Non-normal Modal Logics

2012 ◽  
pp. 384-398
Author(s):  
Graham Priest
Keyword(s):  
Modal Logics ◽  
Normal Modal Logics

scholarly journals Simplified Kripke-Style Semantics for Some Normal Modal Logics

Studia Logica ◽  
2019 ◽  
Vol 108 (3) ◽  
pp. 451-476 ◽  
Author(s):  
Andrzej Pietruszczak ◽  
Mateusz Klonowski ◽  
Yaroslav Petrukhin
Keyword(s):  
Modal Logics ◽  
Normal Modal Logics

A General Lindström Theorem for Some Normal Modal Logics

2013 ◽  
Vol 7 (2) ◽  
pp. 233-264 ◽  
Author(s):  
Sebastian Enqvist
Keyword(s):  
Modal Logics ◽  
Normal Modal Logics ◽  
Lindström Theorem

scholarly journals A tableau-like proof procedure for normal modal logics

1994 ◽  
Vol 129 (1) ◽  
pp. 167-186 ◽  
Author(s):  
Zoran Ognjanović
Keyword(s):  
Modal Logics ◽  
Proof Procedure ◽  
Normal Modal Logics

Non-finitely axiomatisable two-dimensional modal logics

2012 ◽  
Vol 77 (3) ◽  
pp. 970-986 ◽  
Author(s):  
Agi Kurucz ◽  
Sérgio Marcelino
Keyword(s):  
Modal Logics ◽  
Two Dimensional ◽  
Recursively Enumerable ◽  
Bimodal Logics

AbstractWe show the first examples of recursively enumerable (even decidable) two-dimensional products of finitely axiomatisable modal logics that are not finitely axiomatisable. In particular, we show that any axiomatisation of some bimodal logics that are determined by classes of product frames with linearly ordered first components must be infinite in two senses: It should contain infinitely many propositional variables, and formulas of arbitrarily large modal nesting-depth.

Normal monomodal logics can simulate all others

1999 ◽  
Vol 64 (1) ◽  
pp. 99-138 ◽  
Author(s):  
Marcus Kracht ◽  
Frank Wolter
Keyword(s):  
Modal Logic ◽  
Modal Logics ◽  
Normal Modal Logics

AbstractThis paper shows that non-normal modal logics can be simulated by certain polymodal normal logics and that polymodal normal logics can be simulated by monomodal (normal) logics. Many properties of logics are shown to be reflected and preserved by such simulations. As a consequence many old and new results in modal logic can be derived in a straightforward way, sheding new light on the power of normal monomodal logic.

scholarly journals Labelled Tableaux for Non-Normal Modal Logics

2000 ◽  
pp. 119-130 ◽  
Author(s):  
Guido Governatori ◽  
Alessandro Luppi
Keyword(s):  
Modal Logics ◽  
Normal Modal Logics
Sign in / Sign up

Export Citation Format

Share Document