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

Model checking has been used to verify the correctness of digital circuits, security protocols, communication protocols, as they can be modelled by means of finite state transition model. However, modelling the behaviour of hybrid systems like UAVs in a Kripke model is challenging. This work is aimed at capturing the behaviour of an UAV performing cooperative search mission into a Kripke model,...

1 Introduction: Instead of considering propositional S4 (say) as a theory built on top of classical propositional logic, we can consider it as the classical first order theory of its Kripke models. This first order theory can be formulated in any of the ways first order theories usually are: tableau, Gentzen system, natural deduction, conventional axiom system, ε-calculus. If the first order th...

By means of a countermodel we show that the homotopy equivalence of the fibers of a Kan fibration over a connected base cannot be proved constructively.

We present Kripke semantics for some substructural logics with weakening, known as logics with BCK implication. This work is a continuation of the work of Allwein and Dunn on Kripke semantics for Linear Logic, which in turn rested on Dunn’s Gaggle Theory and on Urquhart’s Representation Theory for nondistributive lattices. The basic idea in the representation theory is to use maximally disjoint...

We present an algorithm for checking CTL formulas in Kripke structures with side conditions, where the side conditions define new variables in terms of path formulas. Given any CTL formula where the defined variables may occur, the presented algorithm will determine the set of states where the CTL∗ formula holds that is obtained by replacing each new variable defined by a side condition by its ...

Political scientist Professor Bruce Bueno De Mesquita, has made significant claims for the predictive accuracy of his computational model of group decision making, receiving much popular press, including newspaper articles, books and a television documentary entitled ‘The New Nostradamus’. Despite these and many journal and conference publications related to the topic, no clear elucidation of t...

Standard abstract model checking relies on abstract Kripke structures which approximate the concrete model by gluing together indistinguishable states. Strong preservation for a specification language L encodes the equivalence of concrete and abstract model checking of formulas in L. Abstract interpretation allows to design abstract models which are more general than abstract Kripke structures....