We consider the operation of sum on Kripke frames, where a family frames-summands is indexed by elements another frame. In many cases, modal logic sums inherits finite model property and decidability from summands [Babenyshev Rybakov 2010 ; Shapirovsky 2018 ]. this paper we show that, under general condition, satisfiability problem polynomial space Turing reducible to summands. particular, for ...

Kripke Semantics Yanjing Wang (Amsterdam) In this paper, we give a schema of non-standard Kripke semantics for modal logic, in which the meaning of a modality in a formula depends on the evaluation process of that formula. More precisely, in our semantics schema, the truth condition for a sub-formula [] A of B depends on the path of worlds we passed in the evaluation of B and the position of []...

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

In this paper we define cut-free hypersequent calculi for some intermediate logics semantically characterized by bounded Kripke models. In particular we consider the logics characterized by Kripke models of bounded width Bwk, by Kripke models of bounded cardinality Bck and by linearly ordered Kripke models of bounded cardinality Gk. The latter family of logics coincides with finite-valued Gödel...

Fine and Kripke extended S5, S4, S4.2 and such to produce propositionally quantified systems S5π+, S4π+, S4.2π+: given a Kripke frame, the quantifiers range over all the sets of possible worlds. S5π+ is decidable and, as Fine and Kripke showed, many of the other systems are recursively isomorphic to second-order logic. In the present paper I consider the propositionally quantified system that a...

In this paper I discuss some objections raised by Donnellan (1977) and by Soames (2005) against the examples of contingent a priori truths proposed by Kripke (1980) and by Kaplan (1989). According to Kaplan and Kripke, the mechanism of direct reference alone can guarantee that some contingent truths can be known without any relevant experience. Both Donnellan and Soames claim that the examples ...

In this paper, we use some observations on the nature of biochemical reactions to derive interesting properties of qualitative biochemical Kripke structures. We show that these characteristics make Kripke structures of biochemical pathways suitable for assumption based distributed model checking. The number of chemical species participating in a biochemical reaction is usually bounded by a smal...

In this paper, some distances between KD45n Kripke models are introduced and investigated. We define several distances between Kripke models, based on different criteria, inspired by various concepts such as bisimulation and propositional distances between valuations for different modal degrees. We study the properties of these distances. Such distances are useful for defining belief change ope...

The main goal of model checking is to verify whether a model of a given program satisfies some given specification. In this paper models are regarded as fair or ordinary Kripke structures whereas specifications are represented by formulae branching-time temporal logics (CTL∗X or ACTL ∗ X ). Model checking can be substantially enhanced by reducing the size of models under consideration. Usually ...