Results 1 
3 of
3
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.
Approximating Propositional Calculi by Finitevalued Logics
 In Proc. 24th International Symposium on Multiplevalued Logic
, 1994
"... The problem of approximating a propositional calculus is to find manyvalued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The problem of approximating a propositional calculus is to find manyvalued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI by (computationally easy) manyvalued logics. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of manyvalued logics. It is shown that the optimal candidate matrices for (1) can be computed from the calculus.
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