Results 1  10
of
11
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.
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.
Atomless varieties
 Journal of Symbolic Logic
"... We define a nontrivial variety of boolean algebras with operators such that every member of the variety is atomless. This shows that not every variety of boolean algebras with operators is generated by its atomic members, and thus establishes a strong incompleteness result in (multi)modal logic. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We define a nontrivial variety of boolean algebras with operators such that every member of the variety is atomless. This shows that not every variety of boolean algebras with operators is generated by its atomic members, and thus establishes a strong incompleteness result in (multi)modal logic.
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...
5 MODEL THEORY OF MODAL LOGIC
"... 1.2 Kripke frames and structures................................... 4 1.3 The standard translations into first and secondorder logic.................. 5 1.4 Theories, equivalence and definability.............................. 6 1.5 Polyadic modalities........................................ 8 2 Bi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
1.2 Kripke frames and structures................................... 4 1.3 The standard translations into first and secondorder logic.................. 5 1.4 Theories, equivalence and definability.............................. 6 1.5 Polyadic modalities........................................ 8 2 Bisimulation and basic model constructions.............................. 8
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...