In [17], we introduced a modal logic, called L, which combines intuitionistic propositional logic IPC and classical propositional logic CPC and is complete w.r.t. an algebraic semantics. However, L seems to be too weak for Kripke-style semantics. In this paper, we add positive and negative introspection and show that the resulting logic L5 has a Kripke semantics. For intermediate logics I , we ...

We show that recent Model-driven Engineering that uses sequential finite state models in combination with a common sense logic is subject to efficient model checking. To achieve this, we first provide a formal semantics of the models. Using this semantics and methods for modeling sequential programs we obtain small Kripke structures. When considering the logics, we need to extend this to handle...

This paper presents some testing approaches based on model checking and using different testing criteria. First, test sets are built from different Kripke structure representations. Second, various rule coverage criteria for transitional, non-deterministic, cell-like P systems, are considered in order to generate adequate test sets. Rule based coverage criteria (simple rule coverage, context de...

This book was inadvertently published with the addition of editor’s name, C. J. Posy, as co-author chapter. His name has been removed now and author’s Saul A. Kripke updated in

The recently developed technique of Bohrification associates to a (unital) C*-algebra A 1. the Kripke model, a presheaf topos, of its classical contexts; 2. in this Kripke model a commutative C*-algebra, called the Bohrification of A; 3. the spectrum of the Bohrification as a locale internal in the Kripke model. We propose this locale, the ‘state space’, as a (n intuitionistic) logic of the phy...

In this paper we deal with the semantics for quantified modal logic, QML in short, and their philosophical relevance. In the first part we introduce Kripke semantics for the first-order modal language L= with identity, then we consider some unsatisfactory features of this account from an actualist point of view. In addition, we show that the calculus QE .K + BF on free logic, with the Barcan fo...

In the present paper we study systematically several consequence relations on the usual language of propositional intuitionistic logic that can be defined semantically by using Kripke frames and the same defining truth conditions for the connectives as in intuitionistic logic but without imposing some of the conditions on the Kripke frames that are required in the intuitionistic case. The logic...

The main goal of this paper is to explain the link between the algebraic models and the Kripke-style models for certain classes of propositional non-classical logics. We consider logics that are sound and complete with respect to varieties of distributive lattices with certain classes of well-behaved operators for which a Priestley-style duality holds, and present a way of constructing topologi...

We analyze the asymptotic conditional validity of modal formulas, i.e., the probability that a formula ψ is valid in the finite Kripke structures in which a given modal formula φ is valid, when the size of these Kripke structures grows to infinity. We characterize the formulas ψ that are almost surely valid (i.e., with probability 1) in case φ is a flat, S5consistent formula, and show that thes...

Abst rac t . We extend the notion of bisimulation to Kripke structures with fairness. We define equivalences that preserve fairness and are akin to bisimulation. Specifically we define an equivalence and show that it is complete in the sense that it is the coarsest equivalence that preserves the logic CTL* interpreted with respect to the fair paths. We show that the addition of fairness might c...