Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
In distributed environments, statements from a number of principals, besides the central trusted party, may influence the derivations of authorization decisions. However, existin...
Modal logic represents knowledge that agents have about other agents' knowledge. Probabilistic modal logic further captures probabilistic beliefs about probabilistic beliefs....
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a par...
We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...