Abstract. We compare Kripke models and hypercube systems, a simpli ed notion of Interpreted Systems, as semantic structures for reasoning about knowledge. Our method is to de ne a ...
Abstract. We consider two systems of constructive modal logic which are computationally motivated. Their modalities admit several computational interpretations and are used to capt...
Natasha Alechina, Michael Mendler, Valeria de Paiv...
There has been great progress in recent years on developing effective techniques for reasoning about program equivalence in ML-like languages—that is, languages that combine fea...
Chung-Kil Hur, Derek Dreyer, Georg Neis, Viktor Va...
The problem of finding an approximation to a labeled Markov transition system through hyperfinite transition systems is addressed. It is shown that we can find for each countable ...
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...