Add to ORKGThe paper considers the set of first-order polymodal formulas the modal operators in which can be applied to subformulas of at most one free variable. Using a mosaic technique, we prove a general satisfiability criterion for formulas in , which reduces the modal satisfiability to the classical one. The criterion is then used to single out a number of new, in a sense optimal, decidable fragments of various modal predicate logics
Term modal logics (TML) are modal logics with unboundedly many modalities, with quantification over ...
International audienceModal logics are widely used in computer science. The complexity of modal sati...
The fusion Ll ? Lr of two normal modal logics formulated in languages with disjoint sets of modal op...
When we bundle quantifiers and modalities together (as in ?x?, ??x etc.) in first-order modal logic ...
Modal Logic is traditionally concerned with the intensional operators “possibly ” and “necessary”, w...
International audienceWhen we bundle quantifiers and modalities together (as in ∃x□, ♢∀x etc.) in fi...
International audienceWhen we bundle quantifiers and modalities together (as in ∃x□, ♢∀x etc.) in fi...
abstract. We study and give a summary of the complex-ity of 15 basic normal monomodal logics under t...
This chapter analyzes the development of modal logic within the research framework formulated for a ...
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of th...
We introduce a modal language L which is obtained from standard modal logic by adding the Boolean op...
We introduce a modal language L which is obtained from standard modal logic by adding the Boolean op...
We introduce a modal language L which is obtained from standard modal logic by adding the Boolean op...
We study elementary modal logics, i.e. modal logic considered over first-order definable classes of ...
We introduce a modal language L which is obtained from standard modal logic by adding the Boolean op...
Term modal logics (TML) are modal logics with unboundedly many modalities, with quantification over ...
International audienceModal logics are widely used in computer science. The complexity of modal sati...
The fusion Ll ? Lr of two normal modal logics formulated in languages with disjoint sets of modal op...
When we bundle quantifiers and modalities together (as in ?x?, ??x etc.) in first-order modal logic ...
Modal Logic is traditionally concerned with the intensional operators “possibly ” and “necessary”, w...
International audienceWhen we bundle quantifiers and modalities together (as in ∃x□, ♢∀x etc.) in fi...
International audienceWhen we bundle quantifiers and modalities together (as in ∃x□, ♢∀x etc.) in fi...
abstract. We study and give a summary of the complex-ity of 15 basic normal monomodal logics under t...
This chapter analyzes the development of modal logic within the research framework formulated for a ...
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of th...
We introduce a modal language L which is obtained from standard modal logic by adding the Boolean op...
We introduce a modal language L which is obtained from standard modal logic by adding the Boolean op...
We introduce a modal language L which is obtained from standard modal logic by adding the Boolean op...
We study elementary modal logics, i.e. modal logic considered over first-order definable classes of ...
We introduce a modal language L which is obtained from standard modal logic by adding the Boolean op...
Term modal logics (TML) are modal logics with unboundedly many modalities, with quantification over ...
International audienceModal logics are widely used in computer science. The complexity of modal sati...
The fusion Ll ? Lr of two normal modal logics formulated in languages with disjoint sets of modal op...