A guide to completeness and complexity for modal logics of knowledge and belief

Several widely accepted modal nonmonotonic logics for reasoning about knowledge and beliefs of rational agents with introspection powers are based on strong modal logics such as KD45, S4.4, S4F and S5. In this paper we argue that weak modal logics, ...

We propose a new approach to delineating logics of programs, based directly on inductive definition of program semantics. The ingredients are elementary and well-known, but their fusion yields a simple yet powerful approach, surprisingly overlooked for ...

Explicit modal logic was introduced by S. Artemov. Whereas the traditional modal logic uses atoms □F with a possible semantics "F is provable", the explicit modal logic deals with atoms of form t:F, where t is a proof polynomial denoting a specific ...