Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
This paper gives a characterisation, via intersection types, of the strongly normalising terms of an intuitionistic sequent calculus (where LJ easily embeds). The soundness of the ...
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...