Results 1  10
of
10
Categorical and Kripke Semantics for Constructive S4 Modal Logic
 In International Workshop on Computer Science Logic, CSL’01, L. Fribourg, Ed. Lecture Notes in Computer Science
, 2001
"... 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, etc. Both systems have so far been studied m ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
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, etc. Both systems have so far been studied mainly from typetheoretic and categorytheoretic perspectives, but Kripke models for similar systems were studied independently. Here we bring these threads together and prove duality results which show how to relate Kripke models to algebraic models and these in turn to the appropriate categorical models for these logics.
Generic Composition
, 2002
"... This paper presents a technique called generic composition to provide a uniform basis for modal operators, sequential composition, di#erent kinds of parallel compositions and various healthiness conditions appearing in a variety of semantic theories. The weak inverse of generic composition is define ..."
Abstract

Cited by 21 (13 self)
 Add to MetaCart
This paper presents a technique called generic composition to provide a uniform basis for modal operators, sequential composition, di#erent kinds of parallel compositions and various healthiness conditions appearing in a variety of semantic theories. The weak inverse of generic composition is defined. A completeness theorem shows that any predicate can be written in terms of generic composition and its weak inverse. A number of algebraic laws that support reasoning are derived.
Pure extensions, proof rules and hybrid axiomatics
 Preliminary proceedings of Advances in Modal Logic (AiML 2004
, 2004
"... We examine the role played by proof rules in general axiomatisations for hybrid logic. We prove three main results. First, all known axiomatisations for the basic hybrid language ..."
Abstract

Cited by 16 (6 self)
 Add to MetaCart
We examine the role played by proof rules in general axiomatisations for hybrid logic. We prove three main results. First, all known axiomatisations for the basic hybrid language
Modal Logic: A Semantic Perspective
 ETHICS
, 1988
"... This chapter introduces modal logic as a tool for talking about graphs, or to use more traditional terminology, as a tool for talking about Kripke models and frames. We want the reader to gain an intuitive appreciation of this perspective, and a firm grasp of the key technical ideas (such as bisimul ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
This chapter introduces modal logic as a tool for talking about graphs, or to use more traditional terminology, as a tool for talking about Kripke models and frames. We want the reader to gain an intuitive appreciation of this perspective, and a firm grasp of the key technical ideas (such as bisimulations) which underly it. We introduce the syntax and semantics of basic modal logic, discuss its expressivity at the level of models, examine its computational properties, and then consider what it can say at the level of frames. We then move beyond the basic modal language, examine the kinds of expressivity offered by a number of richer modal logics, and try to pin down what it is that makes them all ‘modal’. We conclude by discussing an example which brings many of the ideas we discuss into play: games.
Categorical and Kripke Semantics for Constructive Modal Logics
, 2001
"... 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 studi ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
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 typetheoretic and categorytheoretic perspectives, but Kripke models for similar systems were studied independently. Here we bring these threads together and prove duality results which show how to relate Kripke models to algebraic models and these in turn to the appropriate categorical models for these logics.
Algebraic Polymodal Logic: A Survey
 LOGIC JOURNAL OF THE IGPL
, 2000
"... This is a review of those aspects of the theory of varieties of Boolean algebras with operators (BAO's) that emphasise connections with modal logic and structural properties that are related to natural properties of logical systems. It begins with ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This is a review of those aspects of the theory of varieties of Boolean algebras with operators (BAO's) that emphasise connections with modal logic and structural properties that are related to natural properties of logical systems. It begins with
Neighborhoods, Ultrafilters, and Canonicity
, 1996
"... This paper will remind the reader of neighborhood semantics for modal logics, compare them with relational semantics, and then look at some questions about neighborhood semantics that have been answered, and some which are still open. We will then introduce "ultrafilter semantics," a way of expressi ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper will remind the reader of neighborhood semantics for modal logics, compare them with relational semantics, and then look at some questions about neighborhood semantics that have been answered, and some which are still open. We will then introduce "ultrafilter semantics," a way of expressing all sets over a canonical frame in an `effable' way. This provides us with a conceptually easy way of dispatching some questions about intensional logics. In particular, we show that all noniterative intensional logics are canonical and we go on to indicate how we can use ultrafilter semantics to demonstrate the canonicity of the Sahlqvist Logics. Neighborhoods, Ultrafilters, and Canonicity Timothy J. Surendonk September 20, 1996 Abstract This paper will remind the reader of neighborhood semantics for modal logics, compare them with relational semantics, and then look at some questions about neighborhood semantics that have been answered, and some which are still open. We will then i...
On Duality for the Modal µCalculus
 Proc. 7th Workshop on Computer Science Logic, volume 832 of Lecture Notes in Computer Science
, 1994
"... . We consider the modal ¯calculus due to Kozen, which is a finitary modal logic with least and greatest fixed points of monotone operators. We extend the existing duality between the category of modal algebras with homomorphisms and the category of descriptive modal frames with contractions to the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. We consider the modal ¯calculus due to Kozen, which is a finitary modal logic with least and greatest fixed points of monotone operators. We extend the existing duality between the category of modal algebras with homomorphisms and the category of descriptive modal frames with contractions to the case of having fixed point operators. As a corollary, we obtain a completeness result for Kozen's original system with respect to a certain class of modal frames. 1 Introduction Modal action logic provides a framework for reasoning about the finitary properties of transition systems. In this paper we consider an enhancement of such a logic with fixed point operators to allow infinitary properties such as fairness (for earlier work, see for example [13] and [10])to be expressed. Fairness properties are statements of substantial complexity. Intuitively, (strong) fairness can be expressed as 8P . P infinitely often enabled implies P infinitely often taken, where P is a process (we refer the r...
Proofs and Expressiveness in Alethic Modal Logic
, 2001
"... Introduction Alethic modalities are the necessity, contingency, possibility or impossibility of something being true. Alethic means `concerned with truth'. [28, p. 132] The above dictionary characterization of alethic modalities states the central notions of alethic modal logic: necessity, and othe ..."
Abstract
 Add to MetaCart
Introduction Alethic modalities are the necessity, contingency, possibility or impossibility of something being true. Alethic means `concerned with truth'. [28, p. 132] The above dictionary characterization of alethic modalities states the central notions of alethic modal logic: necessity, and other notions that are usually thought of as being definable in terms of necessity and Boolean negation: impossibility, contingency, and possibility. The syntax of modal propositional logic is inductively defined over a denumerable set of sentence letters p 0 , p 1 , p 2 , . . . as follows: A ::= p  A  (A # B)  #A The other Boolean operations (#, #, #, # and #) are defined as usual. A formula<F10.9
Fine’s Theorem on FirstOrder Complete Modal Logics
, 2011
"... Fine’s Canonicity Theorem states that if a modal logic is determined by a firstorder definable class of Kripke frames, then it is valid in its canonical frames. This article reviews the background and context of this result, and the history of its influence on further research. It then develops a n ..."
Abstract
 Add to MetaCart
Fine’s Canonicity Theorem states that if a modal logic is determined by a firstorder definable class of Kripke frames, then it is valid in its canonical frames. This article reviews the background and context of this result, and the history of its influence on further research. It then develops a new characterisation of when a logic is canonically valid, providing a precise point of distinction with the property of firstorder completeness. 1 The Canonicity Theorem and Its Impact In his PhD research, completed in 1969, and over the next halfdozen years, Kit Fine made a series of fundamental contributions to the semantic analysis and metatheory of propositional modal logic, proving general theorems about notable classes of logics and providing examples of failure of some significant properties. This work included the following (in order of publication): • A study [6] of logics that have propositional quantifiers and are defined