Named Models in Coalgebraic Hybrid Logic

Named Models in Coalgebraic Hybrid Logic


Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for a given functor, thus covering a wide range of reasoning principles including, e.g., probabilistic, graded, default, or coalitional operators. Specifically, we establish generic criteria for a given coalgebraic hybrid logic to admit named canonical models, with ensuing completeness proofs for pure extensions on the one hand, and for an extended hybrid language with local binding on the other. We instantiate our framework with a number of examples. Notably, we prove completeness of graded hybrid logic with local binding.

Logic in computer science, semantics, deduction, modal logic, coalgebra

2010645-656Nancy, France \firstpageno645 \theoremstyledefinition

DFKIUHB]L. SchröderLutz Schröder IC]D. PattinsonDirk Pattinson


F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic — modal logic; I.2.4 [Artificial Intelligence]: Knowledge Representation Formalisms and Methods — modal logic, representation languages


Modal logics have traditionally played a central role in Computer Science, appearing, e.g., in the guise of temporal logics, program logics such as PDL, epistemic logics, and later as description logics. The development of modal logics has seen extensions along (at least) two axes: the enhancement of the expressive power of basic (relational) modal logic on the one hand, and the continual extension, beyond the purely relational realm, of the class of structures described using modal logics on the other hand. Hybrid logic falls into the first category, extending modal logic with the ability to reason about individual states in models. This feature, originally suggested by Prior and first studied in the context of tense logics and PDL (see [5] for references), is of particular relevance in knowledge representation languages and as such has found its way into modern description logics, where it is denoted by the letter in the standard naming scheme [2].

Extensions along the second axis – semantics beyond Kripke structures and neighbourhood models – include various probabilistic modal logics, interpreted over probabilistic transition systems, graded modal logic over multigraphs [8], conditional logics over selection function frames [6], and coalition logic [17], interpreted over so-called game frames. As a unifying semantic bracket covering all these logics and many further ones, coalgebraic modal logic has emerged ([7] gives a survey). The scope of coalgebraic modal logic has recently been expanded to encompass nominals; we refer to the arising class of logics as coalgebraic hybrid logics. Existing results include a finite model result, an internalized tableaux calculus, and generic upper bounds, but are so far limited to logics that exclude frame conditions and local binding [14]. What is missing from this picture technically is a theory of named canonical models [5]. Named canonical models yield not only strong completeness of the basic hybrid logic, but also completeness of pure extensions, defined by axioms that do not contain propositional variables (but may contain nominals; e.g. in Kripke semantics, the pure axiom , with a nominal, defines transitive frames). Moreover, named canonical models establish completeness for an extended hybrid language with a local binding operator , read as “the current state satisfies ”. Both pure extensions and the language with (not addressed in [14]) are, in general, undecidable [1] (it should be noted, however, that fragments of the language with over Kripke frames are decidable and as such play a role, e.g., in conjunctive query answering in description logic [11]). As a consequence, completeness of pure extensions and local binding is the best we can hope for – it establishes recursive enumerability of the set of valid formulas, and it enables automated reasoning, if not decision procedures.

Specifically, we establish two separate criteria for the existence of named models. Although these criteria are (in all likelihood necessarily) less widely applicable than some previous coalgebraic results including those of [14], the generic results allow us to establish new completeness results for a wide variety of logics; in particular, we prove strong completeness of graded hybrid logic, and ultimately an extension of the description logic , with the binder over a wide variety of frame classes.

1 Coalgebraic Hybrid Logic

To make our treatment parametric in the syntax, we fix a modal similarity type consisting of modal operators with associated arities throughout. For given countably infinite and disjoint sets of propositional variables and of nominals, the set of hybrid -formulas is given by the grammar

where , and is an -ary modal operator. (Alternatively, we could regard propositional variables as nullary modal operators, thus avoiding their explicit mention altogether. We keep them explicit here, following standard practice in modal logic, as we have to deal with valuations anyway due to the presence of nominals.) We use the standard definitions for the other propositional connectives . The set of nominals occurring in a formula is denoted by , similarly for sets of formulas. A formula of the form is called an -formula. Semantically, nominals denote individual states in a model, and stipulates that holds at state .

To reflect parametricity also semantically, we equip hybrid logics with a coalgebraic semantics extending the standard coalgebraic semantics of modal logics [16]: we fix throughout a -structure consisting of an endofunctor on the category of sets, together with an assignment of an -ary predicate lifting to every -ary modal operator , i.e. a set-indexed family of mappings that satisfies

for all . In categorical terms, is a natural transformation where is the contravariant powerset functor.

In this setting, -coalgebras play the roles of frames. A -coalgebra is a pair where is a set of states and is the transition function. When is clear from the context, we refer to just as . A (hybrid) -model consists of a -coalgebra together with a hybrid valuation , i.e. a map that assigns singleton sets to all nominals . We say that is based on the frame . The singleton set is tacitly identified with its unique element.

The semantics of is a satisfaction relation between states in hybrid -models and formulas , inductively defined as follows. For and ,

Modal operators are interpreted using their associated predicate liftings, that is,

where is -ary and denotes the truth-set of relative to . We write if for all . For a set of formulas, we write if for all , and if for all . We say that is satisfiable in a model if there exists a state in such that . If is a set of axioms, also referred to as frame conditions, a frame is an -frame if for all hybrid valuations and all , and a model is an -model if it is based on an -frame. A frame condition is pure if it does not contain any propositional variables (it may however contain nominals). We recall notation from earlier work:

Notation 1

As usual, application of substitutions to formulas is denoted . For a set of formulas and a set of operators, we write or for the set of formulas arising by prefixing elements of with an operator from ; e.g.  and . Moreover, denotes the set of propositional combinations of elements of some set . For , we write if evaluates to in the boolean algebra under a valuation . For , the interpretation of in the boolean algebra under is the inductive extension of the assignment . We write if , and if . A set of formulas is one-step satisfiable w.r.t.  if . We occasionally apply this notation to sets with being just inclusion, in which case mention of is suppressed.

In the sequel, we will be interested in both local and global semantic consequence, where local consequence refers to satisfaction in a single state and global consequence to satisfaction in entire models. In fact, we consider local reasoning under global assumptions: given a set of global assumptions (a TBox in description logic terminology) and a class of models, we say that is a local consequence of under global assumptions for -models, in symbols , if for all such that , whenever (here, both and are sets of arbitrary formulas, in particular not subject to any restrictions on the nesting depth of modal operators). The standard notions of local and global consequence are regained from this general definition by taking or to be empty, respectively.

The distinguishing feature of the coalgebraic approach to hybrid and modal logics is the parametricity in both the logical language and the notion of frame: concrete instantiations of the general framework, in other words a choice of modal operators and a -structure , capture the syntax and semantics of a wide range of modal logics, as witnessed by the following examples.

  • The hybrid version of the modal logic , hybrid for short, has a single unary modal operator , interpreted over the structure consisting of the powerset functor (which takes a set to its powerset ) and the predicate lifting . It is clear that -coalgebras are in 1-1 correspondence with Kripke frames, and that the coalgebraic definition of satisfaction specializes to the usual semantics of the box operator.

  • Graded hybrid logic has modal operators ’in more than successors, it holds that’. It is interpreted over the functor that takes a set to the set of multisets over by . This captures the semantics of graded modalities over multigraphs [8], which are precisely the -coalgebras. A more general set of operators is that of Presburger logic [9], which admits integer linear inequalities among formulas. Unlike in the purely modal case [19], hybrid multigraph semantics visibly differs from the more standard Kripke semantics of graded modalities, as the latter validates all formulas , . However, both semantics agree if we additionally stipulate as a global (pure) axiom. Thus, our completeness results for multigraph semantics derived below do transfer to Kripke semantics. In particular they apply to many description logics, which commonly feature both nominals and graded modal operators in the guise of qualified number restrictions.

  • Hybrid , the hybrid extension of the basic conditional logic , has a single binary modal operator , written in infix notation. Hybrid is interpreted over the functor that maps a set to the set , whose coalgebras are selection function models [6], by putting .

  • Classical hybrid logic (the hybrid version of the logic of neighbourhood frames, referred to as (the minimal) classical modal logic in [6]) has a single, unary modal operator and is interpreted over neighbourhood frames, that is, coalgebras for the functor (more precisely, the double contravariant powerset functor). The semantics of classical modal logic is defined by the lifting . Monotone hybrid logic has the same similarity type, but is interpreted over upwards closed neighbourhood frames, or coalgebras for the functor where upwards closure refers to subset inclusion.

  • The syntax of coalition logic over a set of agents is given by the similarity type , and the operator reads as “coalition has a joint strategy to enforce …”. The formulas of (hybrid) coalition logic are interpreted over game frames, i.e., coalgebras for the functor

    (a class-valued functor, technically speaking, which however does not cause problems). The semantics arises via the liftings

We proceed to present a Hilbert-style proof system for coalgebraic hybrid logics, which we prove to be sound and strongly complete. This requires that the logic at hand satisfies certain coherence conditions between the axiomatization and the semantics — in fact the same conditions as in the purely modal case, which are easily verified local properties that can be verified without reference to -models and are already known to hold for a large variety of logics [16, 19].

Proof systems for coalgebraic logics are most conveniently described in terms of one-step rules, as follows.


A one-step rule over is a rule where and (in fact, may be restricted to be a disjunctive clause, which however is not relevant here). The rule is one-step sound if whenever for a valuation . Given a set of one-step rules and a valuation , a set is one-step consistent [20] if the set is propositionally consistent. One-step sound rules are sound, and we will assume one-step soundness tacitly in the sequel. Completeness hinges on variants of the notion of one-step completeness [19], which we define further below. As the notion of one-step rule does not involve hybrid features, suitable rule sets can just be inherited from the corresponding modal systems; for graded logics, conditional logics, and many others, such rule sets are found, e.g., in [22, 21]. We recall that the one-step complete rule set for (hybrid) consists of the rules

A set of one-step rules now gives rise to a Hilbert system by adjoining propositional tautologies and the hybrid axioms, and closing under modus ponens, rule application, and -necessitation. Formally, we write for a set of formulas, the global assumptions (or the TBox), and a formula if is contained in the smallest set that

  • contains and all instances of propositional tautologies

  • contains all instances of -introduction and make-or-break

    together with all instances of the axioms , , , , , ; and

  • is closed under instances of -generalization , instances of rules in , and modus ponens.

The second group of axioms ensures that defines an equivalence relation on nominals and that distributes over propositional connectives. The (mob) axiom captures the fact that the truth set of an -formula is either empty or the whole model; in the case of hybrid , it is equivalent to the standard back axiom .

We write if there are such that . That is, if there is a proof of from global assumptions that additionally assumes locally. As we assume that all one-step rules in are one-step sound, soundness for both local and global consequence is immediate: we have (for the class of all models) whenever . In [14], a criterion has been given for to be weakly complete, i.e. complete for the case where both the TBox and the set of local assumptions are empty. Here, we extend this result to combined strong global and strong local completeness, i.e. to cover both an arbitrary TBox and an arbitrary set of local assumptions, even if is extended with pure frame conditions and local binding.

2 Strong Completeness of Pure Extensions

Pure completeness is a celebrated result in hybrid logic [3, Chapter 7.3]. In a nutshell, adding pure axioms to an already complete proof system for the hybrid extension of the modal logic (Example 1), one retains completeness with respect to the class of frames that satisfy the additional axioms. In contrast to arbitrary modal axioms, pure axioms do not contain propositional variables, and therefore define – in the classical setting of hybrid – first-order frame conditions. Here, we show that the same theorem is valid for a much larger class of logics, namely all coalgebraic hybrid logics satisfying one of two suitable sets of conditions. For the sake of readability, we restrict the technical development (not the examples) to the case of unary operators from now on until Section 2.2.


If is a set of pure formulas and is a set of one-step rules, we write if there are such that is -derivable from assumptions in where additionally all substitution instances of axioms in and the rule

may be used in deductions. As before, we write if .

In the above system, the rule ( and the rule

are derivable. The system is clearly sound for both global and local consequence over -models in the same sense that is sound over -models.


Let be a set of pure axioms, and let be a TBox. A set is --inconsistent if there are such that . Otherwise, is --consistent. A subset of , i.e. a set of -formulas, is called an ABox (again borrowing terminology from description logic). A maximally --consistent ABox is a maximal element among the --consistent ABoxes, ordered by inclusion. For such a , we write , where , and put . For the construction of a named model, we now fix a maximally --consistent ABox . Later, we will take to be a maximally consistent extension of a given set of formulas, where we may assume, thanks to the rule , that . We note the following trivial facts: {lem} We have for all and all substitutions , and moreover . Our goal is the construction of named canonical models in the following sense: {defi} A named canonical -model is a model such that

for every nominal , where . It is clear that named canonical models are countable, as there are only countably many nominals. {lem}[Truth lemma for named canonical models] If is a named canonical -model and is a hybrid formula, then for every ,

Hence, , and is an -model.

The last clause of the truth lemma follows from Lemma 2, the crucial point being that satisfaction of all substitution instances of implies frame satisfaction of because every state in the model is denoted by some nominal. We now establish two criteria for the existence of named canonical models. The first criterion assumes a stronger form of one-step completeness than the second, which instead demands that the modalities are bounded.

2.1 Pure Completeness for Strongly One-Step Complete Logics

The construction of named models hinges on the following notion of pastedness, which assures that nominals interact correctly across the whole model. For the rest of the section, we fix a one-step complete rule set , a set of pure axioms, and a set of global assumptions, and we write ‘consistent’ instead of ’-–consistent’.


An ABox is -pasted if whenever for all nominals , then for all nominals . It is clear that can induce a named model only if is -pasted. The construction of pasted ABoxes requires a Henkin-like extension of the logical language by adding new nominals. Generally, we denote by an extended language with countably many new nominals not appearing in . We note the fact (slightly glossed over in the literature) that this extension is conservative: {lem} If is consistent, then remains consistent in .


[Extended Lindenbaum lemma for -Pasted Sets] If is consistent, then there exists a -pasted maximally consistent ABox and a nominal in such that .

(The proof of the above version of the Lindenbaum lemma uses Lemma 2.1, and exploits the rule to introduce the nominal .) As we are aiming for strong completeness results, (weak) one-step completeness as employed in weak completeness proofs using finite models [14, 19] is no longer adequate. Accordingly, our first criterion assumes a stronger condition: {defi} A rule set is strongly one-step complete if for every set , every one-step consistent subset of is one-step satisfiable. {lem}[Named existence lemma, Version 1] If is -pasted and is strongly one-step complete, then there exists a named canonical -model. In summary, we have: {thm} If is strongly one-step complete, then every extension of by pure axioms is both globally and locally strongly complete over countable hybrid models when equipped with the rule. That is, if and , then whenever , where is the class of countable -models.


As usual, we show that every --consistent set is satisfiable in a countable -model such that (where satisfiability is clearly invariant under passing from to ). The extended Lindenbaum lemma yields a -pasted maximally consistent subset ABox and a nominal in such that . By the named existence lemma, we find a named, hence countable, canonical -model , and by the truth lemma (Lemma 2), is an -model, , and .


In the literature (e.g. [3, Theorem 7.29]), the above completeness theorem is sometimes phrased as “completeness with respect to named models”, i.e. models where every state is the denotation of some nominal; such models also played a central role in the early development of hybrid logic by the Sofia school (see e.g. [15]). In detail, this means that every state of the model is the denotation of a nominal in a language extended with countably many new nominals. This extension is necessary, as otherwise the consistent set would be satisfiable in a model where every state is named by a nominal of the original language, which is clearly impossible. Completeness with respect to models where every state is named by a nominal in an extended language, on the other hand, is an immediate consequence of completeness with respect to countable models. {exa} The previous theorem establishes strong completeness results for pure extensions of all hybrid logics with neighbourhood semantics (Example 1.4) that are defined by rank-1 axioms [20], i.e. modal formulas where the nesting depth of modalities is uniformly equal to (such as the monotonicity axiom ). For the monotonic cases, i.e. extensions of monotonic hybrid logic, these results are essentially known [24], while they seem to be new for the non-monotonic cases, i.e. extensions of classical hybrid logic not containing the monotonicity axiom, including, e.g., various deontic logics [12]. Moreover, the theorem newly proves strong completeness of the hybridization of coalition logic, as Theorem 3.2 of [17] essentially states that coalition logic satisfies strong one-step completeness.

2.2 Pure Completeness for Bounded Logics

The condition of strong one-step completeness used in the previous section is a comparatively rare phenomenon [20]; the strength of the condition becomes clear in the fact that, unlike in the classical case of Kripke semantics, the above did not require a notion of -pastedness [5]. We proceed to present an alternative approach for the case where one does have an analogue of the (-1) rule — this is the case if the operators are bounded, i.e., their satisfaction hinges, in each case, on only finitely and boundedly many states of a model. {defi} A modal operator is -bounded for with respect to a -structure if for every set and every ,

(This implies in particular that is monotonic.) We say that is bounded w.r.t. if every modal operator in is -bounded for some . The boundedness of an operator can now be internalized in the logical deduction system. In particular, for -bounded operators , one has the paste rule

with the side condition that the are pairwise distinct fresh nominals. We write if is derivable from assumptions in in the system where additionally the rule may be used in deductions for -bounded operators . This induces the notion of --consistency, which we briefly refer to as consistency as we fix , , and throughout. Again, the system is clearly sound, i.e. whenever , where is the class of -models.

  • Hybrid . The modal operator is -bounded. The arising paste rule is precisely the rule of [4].

  • Graded hybrid logic. The modal operator is -bounded. One thus has a paste rule

    with side conditions as before.

  • Positive Presburger hybrid logic. A Presburger operator (Example 1) is -bounded if the are positive. E.g., this still allows expressing the statement, generally believed to be valid in the German national football league, that a team that has at least points will not be relegated: .

The generalized -pastedness condition for bounded operators is as follows. {defi} Let be bounded. An ABox is -pasted if whenever is -bounded and , then for some nominals . Again, it is clear that if is bounded, then can induce a named model only of is -pasted. It is easy to see that if is one-step complete and is bounded (in fact already if derives monotony for every ), then every -pasted set is also -pasted (Definition 2.1). {lem}[Extended Lindenbaum lemma for -pasted sets] Let be bounded. If is consistent, then there exist a -pasted maximally consistent ABox and a nominal in such that , where is as in Section 2.1. Bounded operators now allow us to use a weaker version of one-step completeness. Instead of requiring that all one-step consistent sets are one-step satisfiable, we may restrict to finite extensions of propositional variables. {defi} We say that is strongly finitary one-step complete if for every set , every one-step consistent subset of is one-step satisfiable. Clearly, any strongly one-step complete rule set is also strongly finitary one-step complete, but the example of graded hybrid logic witnesses that the converse is not true. We note that the weaker criterion still fails for probabilistic logics due to inherent non-compactness [23]; probabilistic logics also fail to be bounded, as a given probability can be split into any number of summands. Together with boundedness, the above condition enables a second version of the named existence lemma. {lem}[Named existence lemma, Version 2] If is bounded, is strongly finitary one-step complete, and is -pasted, then there exists a named canonical -model. Summarizing the above, we have the following extended completeness result. {thm} Let be bounded, and let be strongly finitary one-step complete. Then every extension of by pure axioms is globally and locally strongly complete over countable hybrid models when equipped with the and rules. In other words, if , , and is the class of all countable -models, then whenever . The proof follows the same route via extended Lindenbaum lemma, existence lemma, and truth lemma as for Theorem 2.1. {exa} By Example 2.2 and the fact that the known complete axiomatizations of the associated modal logics are in fact strongly finitary one-step complete, the previous theorem proves completeness of pure extensions of hybrid , graded hybrid logic, and positive Presburger hybrid logic. Except for the standard case of hybrid , these results seem to be new. In particular, we obtain completeness of pure extensions of graded (or positive Presburger) hybrid logic defining the following frame classes in multigraph semantics:

  • The class of Kripke frames, seen as the class of multigraphs where the transition multiplicity between two individual states is always at most , defined by the pure axiom .

  • The class of reflexive multigraphs, defined by the pure axiom .

  • The class of transitive multigraphs, defined by the pure axioms , .

  • The class of symmetric multigraphs, i.e., those where the transition multiplicity from to always equals the one from to , which is defined by the pure axioms .

Other frame classes of interest, see e.g. [3, Section 7.3], can be characterized similarly by translating the corresponding frame conditions from Kripke to multigraph semantics.

2.3 The Mixed Case

In some cases, the two methods laid out in the preceding sections can be combined for modal operators with several arguments that adhere, in each of their arguments, to one of the respective sets of semantic conditions. For the sake of readability, we formulate this explicitly only for the mixed binary case with a single modal operator, i.e. we assume in this section that with binary; the generalization to arbitrary numbers of arguments, several modal operators etc. should be obvious, and essentially only requires more elaborate terminology and notation. {defi} We say that is (strongly, strongly finitary) one-step complete if every one-step consistent subset of is one-step satisfiable. Moreover, we say that is -bounded in the second argument for if for every set and all , In the same manner as for Theorems 2.1 and 2.2, we derive: {thm} If is (strongly, strongly finitary) one-step complete and is -bounded in the second argument, then every extension of by pure axioms is both locally and globally strongly complete over countable hybrid models when equipped with the appropriate and rules. {exa} Hybrid (Example 1) is easily seen to be (strongly, strongly finitary) one-step complete, and the operator defined from the conditional operator by is -bounded in the second argument. By the above, it follows that every pure extension of hybrid is strongly complete over countable hybrid selection function models. E.g. we may define the class of conditional frames where all expressible conditions induce transitive relations by pure axioms . Such frames satisfy also the dual axiom (using a propositional variable ) , an axiom for duplicating conditional assumptions. Similar statements apply to a combination of graded and conditional logic (obtainable compositionally using the methods of [21]), which has operators of the form “if , then one normally has more than instances of ”.

The semantics of conditional logics in general has complex ramifications, involving, e.g., preference orderings or systems of spheres (see, e.g., [10, 18]); application of our methods to conditional logics beyond is the subject of further investigation. We note that pure completeness of a hybrid extension of Lewis’ logic of counterfactuals has been established recently [18].

3 Local Binding

We next investigate completeness of a stronger hybrid language that includes the binder, which binds a state variable to the current state. Concretely, we allow formulas of the form , wherein the nominal is locally bound (for compactness of presentation, we give up the usual distinction between nominals and state variables). Given a modal similarity type , we write for the ensuing extension of . The reading of the formula is “ holds for the current state ”. The satisfaction relation in the extended logic is defined by an additional clause for the binder,

where is a state in a coalgebra and is obtained from by modifying the value of to . The semantics of the binder immediately translates into the axiom scheme (see e.g. [4])

Given a set of -rules, a set of formulas and a set of pure axioms, we write for the extension of the associated provability predicate with . Using , one easily proves an extension of the truth lemma for named models (Lemma 2) to , so that the completeness results for pure extensions proved before (Theorems 2.12.2, and 2.3) transfer immediately to . We make this explicit for the bounded case: {thm} If is bounded and is strongly finitary one-step complete, then every pure extension of is strongly locally and globally complete over countable hybrid models. In other words, iff for all and all , where is the class of all countable -models.


As noted in [24], the named model construction more generally yields completeness for any locally definable extension of the hybrid language, i.e. any extension whose semantics at named states is defined by a formula similar to .


Continuing Example 2.2, Theorem 3 reproves not only the known completeness of pure extensions of hybrid with , but also the completeness of pure extensions of graded (or positive Presburger) hybrid logic with . This extends easily to the multi-agent case, or, in description logic terminology, to description logics with multiple roles. As, moreover, both a role hierarchy and transitivity of roles can be defined using pure axioms, we thus arrive at a complete axiomatization of an extension of the description logic with satisfaction operators and , which has been used in connection with conjunctive query answering [11], and allows, e.g., talking about the number of stepchildren of a stepmother, in continuation of the stepmother example from [13], .

4 Conclusions

We have laid out two criteria for the existence of named canonical models in coalgebraic hybrid logics — one that applies to cases where one has an analogue of the so-called Paste- rule of standard hybrid logic, and one which applies to cases where one does not need any such rule. While the latter means essentially that the logic is equipped with a neighbourhood semantics, the former requires that all modal operators of the logic are bounded, i.e. there is always only a bounded number of states relevant for their satisfaction at each point. Our main novel example of this type is graded hybrid logic (and an extension of it using certain Presburger modalities [9]). The named model construction entails completeness of pure extensions and completeness of extended hybrid languages with the local binder (of which the I–me construct of [13] is a single-variable restriction), which we thus obtain as new results for, e.g., hybrid coalition logic, hybrid classical modal logic, several hybrid deontic logics, hybrid conditional logic, graded hybrid logic, and an extension of the description logic . An open question that remains is the existence of so-called orthodox axiomatizations [4] in the presence of , as well as to find an analogue of the characterization result of [24] stating that a variant of the Paste- rule characterizes the Kripke models among the topological models of . A further topic of investigation is to find decidable fragments of the language with ; we note slightly speculatively that the fragment used in [13] may, in our terminology, be seen as requiring that a suitably defined NNF of a formula contains only positive occurrences of bound nominals under bounded modal operators.


  1. C. Areces, P. Blackburn, and M. Marx. A road-map on complexity for hybrid logics. In Computer Science Logic, CSL 99, vol. 1683 of LNCS, pp. 307–321, 1999.
  2. F. Baader, D. Calvanese, D. L. McGuinness, D. Nardi, and P. F. Patel-Schneider, eds. The Description Logic Handbook. Cambridge University Press, 2003.
  3. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, 2001.
  4. P. Blackburn and B. ten Cate. Pure extensions, proof rules, and hybrid axiomatics. Stud. Log., 84:277–322, 2006.
  5. P. Blackburn and M. Tzakova. Hybrid languages and temporal logic. Logic J. IGPL, 7:27–54, 1999.
  6. B. Chellas. Modal Logic. Cambridge University Press, 1980.
  7. C. Cirstea, A. Kurz, D. Pattinson, L. Schröder, and Y. Venema. Modal logics are coalgebraic. The Computer Journal, 2009. In print.
  8. G. D’Agostino and A. Visser. Finality regained: A coalgebraic study of Scott-sets and multisets. Arch. Math. Logic, 41:267–298, 2002.
  9. S. Demri and D. Lugiez. Presburger modal logic is only PSPACE-complete. In Automated Reasoning, IJCAR 06, vol. 4130 of LNAI, pp. 541–556. Springer, 2006.
  10. N. Friedman and J. Y. Halpern. On the complexity of conditional logics. In Knowledge Representation and Reasoning, KR 94, pp. 202–213. Morgan Kaufmann, 1994.
  11. B. Glimm, I. Horrocks, and U. Sattler. Conjunctive query answering for description logics with transitive roles. In Description Logics, DL 06, vol. 189 of CEUR Workshop Proceedings., 2006.
  12. L. Goble. A proposal for dealing with deontic dilemmas. In Deontic Logic in Computer Science, DEON 04, vol. 3065 of LNAI, pp. 74–113. Springer, 2004.
  13. M. Marx. Narcissists, stepmothers and spies. In Description Logics, DL 02, CEUR Workshop Proceedings, 2002.
  14. R. Myers, D. Pattinson, and L. Schröder. Coalgebraic hybrid logic. In Foundations of Software Science and Computation Structures, FOSSACS 09, LNCS. Springer, 2009. To appear.
  15. S. Passy and T. Tinchev. PDL with data constants. Inf. Process. Lett., 20:35–41, 1985.
  16. D. Pattinson. Coalgebraic modal logic: Soundness, completeness and decidability of local consequence. Theoret. Comput. Sci., 309:177–193, 2003.
  17. M. Pauly. A modal logic for coalitional power in games. J. Logic Comput., 12:149–166, 2002.
  18. K. Sano. Hybrid counterfactual logics. J. Log. Lang. Inf., 18:515–539, 2009.
  19. L. Schröder. A finite model construction for coalgebraic modal logic. J. Log. Algebr. Prog., 73:97–110, 2007.
  20. L. Schröder and D. Pattinson. Rank-1 modal logics are coalgebraic. J. Logic Comput. In print.
  21. L. Schröder and D. Pattinson. Modular algorithms for heterogeneous modal logics. In Automata, Languages and Programming, ICALP 07, vol. 4596 of LNCS, pp. 459–471. Springer, 2007.
  22. L. Schröder and D. Pattinson. PSPACE bounds for rank-1 modal logics. ACM Trans. Comput. Log., 10(2:13):1–33, 2009.
  23. L. Schröder and D. Pattinson. Strong completeness of coalgebraic modal logics. In Theoretical Aspects of Computer Science, STACS 09, Leibniz International Proceedings in Informatics, pp. 673–684. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2009.
  24. B. ten Cate and T. Litak. Topological perspective on the hybrid proof rules. In Hybrid Logic, HyLo 06, vol. 174 of ENTCS, pp. 79–94, 2007.
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
Add comment
Loading ...
This is a comment super asjknd jkasnjk adsnkj
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test description