The Kuznetsov–Index of a modal logic is the least cardinal μ such that any consistent formula has a Kripke–model of size ≤ μ if it has a Kripke–model at all. The Kuznetsov–Spectrum is the set of all Kuznetsov–Indices of modal logics with countably many operators. It has been shown by Thomason that there are tense logics with Kuznetsov–Index iω+ω. Futhermore, Chagrov has constructed an extension...

DoSen, K., Rudimentary Kripe models for the intuitionistic propositional calculus, Annals of Pure and Applied Logic 62 (1993) 21-49. It is shown that the intuitionistic propositional calculus is sound and complete with respect to Kripke-style models that are not quasi-ordered. These models, called rudimentary Kripke models, differ from the ordinary intuitionistic Kripke models by making fewer a...

We establish a connection between term definability of Boolean functions and definability of finite modal frames. We introduce a bijective translation between functional terms and uniform degree-1 formulas and show that a class of Boolean functions is defined by functional terms if and only if the corresponding class of Scott-Montague frames is defined by the translations of these functional te...

We extend the Kripke-like model theory given in 10] for a fragment of rst-order hereditary Harrop formulae to include negated atoms in goals. This gives us a formal framework in which to study the role of Negation as Failure rule. The class of predicates for which Negation As Failure is applicable is discussed, as well as the predicates for which some other form of negation will need to be used...

Frame and anti-frame rules have been proposed as proof rules for modular reasoning about programs. Frame rules allow one to hide irrelevant parts of the state during verification, whereas the anti-frame rule allows one to hide local state from the context. We discuss the semantic foundations of frame and anti-frame rules, and present the first sound model for Charguéraud and Pottier’s type and ...

We build on the established work on modal transition systems and probabilistic speciications to sketch a framework in which system description, abstraction, and nite-state model checking all have a uniform presentation across various levels of qualitative and quantitative views together with mediating abstraction and concretization maps. We prove safety results for abstractions within and acros...

Usual normalization by evaluation techniques have a strong relationship with completeness with respect to Kripke structures. But Kripke structures is not the only semantics that ts intuitionistic logic: Heyting algebras are a more algebraic alternative. In this paper, we focus on this less investigated area: how completeness with respect to Heyting algebras generate a normalization algorithm fo...

Fusion is a well-known form of combining normal modal logics endowed with a Hilbert calculi and a Kripke semantics. Herein, fusion is studied over logic systems using sequent calculi labelled with truth values and with a semantics based on a two-sorted algebra allowing, in particular, the representation of general Kripke structures. A wide variety of logics, including non-classical logics like,...

We consider two systems of constructive modal logic which are computationally motivated. Their modalities admit several computational interpretations and are used to capture intensional features such as notions of computation, constraints, concurrency design, etc. Both systems have so far been studied mainly from a type-theoretic and category-theoretic perspectives, but Kripke models for simila...

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