Although presented with a variety of ‘flavours’, the notion of an interactor, as an abstract characterisation of an interactive component, is well-known in the area of formal ...
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...
We discuss recent work generalising the basic hybrid logic with the difference modality to any reasonable notion of transition. This applies equally to both subrelational transiti...