The language of timed µCRL is an extension of an ACP-style process algebra-based language µCRL with time-related features. In this paper we describe this language and its equati...
In this paper we study the intermediate logic MLO(X) of open subsets of a metric space X. This logic is closely related to Medvedev's logic of finite problems ML. We prove sev...
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which every other valid equivalence is derivable. Specifically, we axiomatize downwar...
Reasoning about permissions and obligations sometimes requires to distinguish more than one level of permission: certain actions are preferable to others, or one has more confiden...