Dynamic programs, or fixpoint iteration schemes, are useful for solving many problems on state spaces, including model checking on Kripke structures (“verification”), computing shortest paths on weighted graphs (“optimization”), computing the value of games played on game graphs (“control”). For Kripke structures, a rich fixpoint theory is available in the form of the μ-calculus. Yet few connec...

In the paper we introduce logical calculi for representation of propositions with modal operators indexed by fuzzy values. There calculi are called Heyting-valued modal logics. We introduce the concept of a Heyting-valued Kripke model and consider a semantics of Heyting-valued modal logics at the class of Heyting-valued Kripke models.

Weakening the conditions on the Kripke semantics for propositional intuitionistic logic (J) unearths a family of logics below J. This paper provides a characterization of eleven such logics, using Kripke semantics, proof theory, and algebraic models. Questions about modelling quantification in these logics are also discussed.

This section looks back to some ground-breaking contributions to public health, reproducing them in their original form and adding a commentary on their significance from a modern-day perspective. This month Mary Norval reviews the 1977 paper by Michael Fisher andMargaret Kripke on ultraviolet light irradiation and its relationship to ultraviolet carcinogenesis. The original paper is reproduced...

Dynamic programs, or xpoint iteration schemes, are useful for solving many problems on state spaces, including model checking on Kripke structures (\veri cation"), computing shortest paths on weighted graphs (\optimization"), computing the value of games played on game graphs (\control"). For Kripke structures, a rich xpoint theory is available in the form of the -calculus. Yet few connections ...

Model Repair George Chatzieleftheriou, Borzoo Bonakdarpour, Scott A. Smolka, and Panagiotis Katsaros 1 Department of Informatics, Aristotle University of Thessaloniki 54124 Thessaloniki, Greece 2 School of Computer Science, University of Waterloo 200 University Avenue West Waterloo N2L3G1, Canada 3 Department of Computer Science, Stony Brook University Stony Brook, NY 11794-4400, USA Abstract. ...

We investigate several intuitionistic modal logics (IMLs), mainly from semantical viewpoint. In these decades, in the area of type theory for programming language, various type systems corresponding (via Curry-Howard correspondence) to IMLs have been considered. However, IMLs arising from such a context are not extensively studied before. We try to understand the logical meaning of such IMLs, a...