Usually, in the Kripke semantics for intuitionistic propositional logic (or for superintuitionistic logics) partially ordered frames are used. Why? In this paper we propose an intrinsically intuitionistic motivation for that. Namely, we show that every Kripke frame (with an arbitrary accessibility relation), whose set of valid formulas is a superintuitionistic logic, is logically equivalent to ...

A runtime verification technique has been developed for CSP via translation of CSP models to Kripke structures. With this technique, we can check that a system under test satisfies properties of traces and refusals of its CSP model. This complements analysis facilities available for CSP and for all languages with a CSP-based semantics: Safety-Critical Java, Simulink, SysML, and so on. Soundness...

A. An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [10]. We extend the Kripke semantics of intuitionistic logic, enriching each possible Kripke state with a set of places, and show that this semantics is both sound and complete for the logic. In the semantics, resources of a distributed system are interpreted as atoms, and pl...

Kripke semantics plays a fundamental role for modal logics. (?) suggests a natural generalisation of Kripke semantics for modal logics to an analogous kind of semantics (generalised Kripke semantics) for a broader setting including that of substructural logics. The algebraic structure underlying a traditional Kripke model is the powerset of a set of worlds. The generalisation used here allows u...

We investigate the logical structure of intuitionistic Kripke-Platek set theory IKP , and show that first-order logic is IQC .

The well-known Dyckoff’s 1992 calculus/procedure for intuitionistic propositional logic is considered and analyzed. It is shown that the calculus is Kripke complete and the procedure in fact works in polynomial space. Then a multi-conclusion intuitionistic calculus is introduced, obtained by adding one new rule to known calculi. A simple proof of Kripke completeness and polynomial-space decidab...