Model checking [3] is a very popular paradigm for automatic verification of properties of finite state systems like those defined by circuits or communication protocols. A system is interpreted as a finite state labeled transition system or equivalently as a finite Kripke structure. If sys contains k concurrent components, each with m states, then the Kripke structure described by sys may have ...

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...

We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of a given logic and relational structures used to define the Kripke possible-world semantics for it. Such a new framework offers a new semantics for many-valued logics based on the truth-invariance entailment. Consequently...

In epistemic logic, Kripke structures are used to model the distribution of information in a multi-agent system. In this paper, we present an approach to quantifying how much information each particular agent in a system has, or how important the agent is, with respect to some fact represented as a goal formula. It is typically the case that the goal formula is distributed knowledge in the syst...

It is shown that every normal intuitionistic modal logic L over MIPC has the nite model property if there exists a universal rstorder sentence such that (1) L is characterized by the class of Kripke frames satisfying and (2) every Kripke frame that validates L satis es . Here, MIPC is a well-known intuitionistic modal logic introduced by Prior (1957).

The Gentzen-Kripke construction of the semantics for intermediate logic LQ, which is obtainable from the intuitionistic propositional logic H by adding the weak law of excluded middle -*A v —• —1>4, is presented. Our construction spans the Gentzen system and the Kripke semantics for LQ by providing the way from the cut-elimination theorem to model-theoretic results. The completeness and decidab...

Kripke semantics plays a fundamental role for modal logics where it often provides modular semantics allowing a clear treatment of various logics related by the addition of axioms or connectives. Kripke semantics is also the “natural semantics” for classical modal logic in the sense that it is given by the representation theory for modal algebras. The algebraic structure corresponding to a trad...

We take the well-known intuitionistic modal logic of Fischer Servi with semantics in bi-relational Kripke frames, and give the natural extension to topological Kripke frames. Fischer Servi’s two interaction conditions relating the intuitionistic pre-order (or partial-order) with the modal accessibility relation generalise to the requirement that the relation and its inverse be lower semi-contin...

A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic formal system, hoHH(C) (higher-order hereditary Harrop formulas with constraints), which extends λProlog’s logic, is shown sound and complete. A Kripke semantics for equational reasoning in the simply typed lambda-calcu...