Modal logic
(un)decidabilityalgebraic modal logicarrow logicbisimulationcompletenesscomplexity classescorrespondence theoryexpressivenessextensions of modal logicguarded fragmenthybrid logiclogic of relational structuresmodal definabilitymodal languagesmodal model theorypropositional modal logictense logic
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
This textbook on modern propositional modal logic is exceptional in every respect. The exposition of the subject is very clear and careful. The eloquent and didactically experienced authors succeed in exciting the reader's curiosity and guiding her/him on her/his way to (and through) the crucial points, always providing the right degree of support. The book is divided into seven chapters, preceded by a preface that puts the reader in the right mood for dealing with modal logic, at least for a while. Each chapter starts out with a `chapter guide' introducing the contents of the respective sections. Moreover, all sections are assigned to either the `basic track' (the major part of a chapter each time) or the `advanced track'. Several exercises make up an essential part of every section. After the subject of a chapter has been presented, a `summary' orders the material once again with regard to the newly treated ideas and methods. Concluding a chapter, detailed notes are given concerning references and related topics. Four appendices follow the main part of the book, supplying the reader with background material from logic, algebra and computer science, and a guidance on further reading, respectively, which is well received not only because it is always kindly disposed towards the works referred to. The book is concluded by an extensive bibliography, a nicely structured list of notation, and an exhaustive index. The headings of the individual chapters read as follows: Basic concepts -- Models -- Frames -- Completeness -- Algebras and general frames -- Computability and complexity -- Extended modal logic. In the following, we rather touch on some of the topics treated there than report the complete content (not even all of the highlights). -- The fundamental approach of the book, viz viewing modal logic as a logic of relational structures, is developed in the introductory chapter. Basic modal and tense logic, arrow logic, and propositional dynamic logic, serve as the standard examples of the different shaping of modal logic here (and later on as well). The first chapter contains also a broad historical overview. -- The second chapter focuses on modal model theory. In this context the key idea is bisimulation, subsuming many of the model-connecting means studied in modal logic earlier. Van Benthem's characterization of the modal fragment of first-order logic is presented as the first result on the advanced track. -- The third chapter is mainly about modal definability and correspondence theory. In particular, the famous Sahlqvist Correspondence Theorem is proved. -- Much of the efforts made in modal logic revolved around completeness. Several methods for proving completeness are explained and applied in the midchapter of the book, in particular, to the sample logics mentioned above. -- The next chapter deals with algebraic modal logic. The Jónsson-Tarski Theorem and the Sahlqvist Completeness Theorem are proved, among other things. Furthermore, the part general frames play in modal logic is made clear. -- The penultimate chapter takes the significance of modal logic for computer science into account. Several techniques for proving (un)decidability are exemplified, and the particularly relevant complexity classes NP, PSACE and EXPTIME are examined modally. -- Some extensions of modal logic are treated in the final chapter of the book, including hybrid logic, the guarded fragment, and multi-dimensional modal logic. The book is aimed at (and actually suited to) a widespread target group ranging from students to researchers, from logicians to linguists. In our opinion, it is useful especially for people working in (fields related to) computer science (although implementation-oriented modal proof theory is omitted deliberately). The main point of the book, however, is this: the beauty of modal logic becomes apparent, over and above all the various areas of application.
- Towards a ``sophisticated model of belief dynamics. II: Belief revision
- A proof-theoretic study of the correspondence of hybrid logic and classical logic
- On combinations of propositional dynamic logic and doxastic modal logics
- A hybrid logic for reasoning about knowledge and topology
- Developing bounded reasoning
- Epistemic logic for rule-based agents
- A logic of situated resource-bounded agents
- Non-deterministic semantics for dynamic topological logic
- Solving the \$100 modal logic challenge
- On modal \(\mu \)-calculus and Gödel-Löb logic
- How true it is = who says it's true
- Topological duality for Boolean algebras with a normal \(n\)-ary monotonic operator
- Substitution Frege and extended Frege proof systems in non-classical logics
- Modal languages for topology: expressivity and definability
- Coalgebraic logic for stochastic right coalgebras
- Public and private communication are different: Results on relative expressivity
- Axiomatic characterization of the AGM theory of belief revision in a temporal logic
- Metatheory of actions: beyond consistency
- Bounded model checking for knowledge and real time
- Everything else being equal: a modal logic for ceteris paribus preferences
- Determining the environment: a modal logic for closed interaction
- Reasoning about cooperation, actions and preferences
- Introspective forgetting
- Merging frameworks for interaction
- Multi-modal CTL: completeness, complexity, and an application
- Knowledge forgetting: properties and applications
- Terminating tableau systems for hybrid logic with difference and converse
- Hybrid counterfactual logics. David Lewis meets Arthur Prior again
- Hybrid logic meets IF modal logic
- Tools and techniques in modal logic
- Modal logic as metalogic
- Zero-one laws for modal logic
- Multi-dimensional modal logic
- A polynomial space construction of tree-like models for logics with local chains of modal connectives
- Repairing the interpolation theorem in quantified modal logic
- True lies
- Abstract logical constants
- On the modal logic of Jeffrey conditionalization
- Computation as social agency: what, how and who
- Covering-based rough sets and modal logics. II.
- Higher-order contingentism. III: Expressive limitations
- On Sahlqvist formulas in relevant logic
- Formal reasoning in preference-based multiple-source rough set model
- Resolving distributed knowledge
- Typology of axioms for a weighted modal logic
- Compositional meaning in logic
- Quantification in some non-normal modal logics
- Nonclassical probability and convex hulls
- ``That will do: logics of deontic necessity and sufficiency
- The finite model property for logics with the tangle modality
- Correspondence between Kripke frames and projective geometries
- Bisimulation and expressivity for conditional belief, degrees of belief, and safe belief
- On a new tentative solution to Fitch's paradox
- On the modal logic of the non-orthogonality relation between quantum states
- Reverse public announcement operators on expanded models
- A first-order coalition logic for BDI-agents
- Second-order propositional modal logic: expressiveness and completeness results
- On modal logics arising from scattered locally compact Hausdorff spaces
- Completeness for \(\mu\)-calculi: a coalgebraic approach
- A semantic hierarchy for intuitionistic logic
- Propositional epistemic logics with quantification over agents of knowledge
- On graphs for intuitionistic modal logics
- Expressivity in chain-based modal logics
- Implicit, explicit and speculative knowledge
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
- Keep changing your beliefs, aiming for the truth
- Local properties in modal logic
- More on \(d\)-logics of subspaces of the rational numbers
- Preservation of Sahlqvist fixed point equations in completions of relativized fixed point Boolean algebras with operators
- A coordination approach to mobile components
- Natural deduction for first-order hybrid logic
- Stable formulas in intuitionistic logic
- Independence of the dual axiom in modal \(\mathbf{K}\) with primitive
- The complexity of satisfiability in non-iterated and iterated probabilistic logics
- Towards reasoning about Petri nets: a propositional dynamic logic based approach
- Guarded fixed point logics and the monadic theory of countable trees.
- Modal logic, truth, and the master modality.
- Coalgebraic modal logic: soundness, completeness and decidability of local consequence
- Normal conditions for inference relations and injective models
- Memory and perfect recall in extensive games
- Modal and guarded characterisation theorems over finite transition systems
- Complexity results of STIT fragments
- What is a logic translation?
- A new conditional for naive truth theory
- Global view on reactivity: switch graphs and their logics
- Constrained consequence
- _1-completions of a poset.
- Resource bisimilarity and graded bisimilarity coincide
- Predicate metric tense logic for `now' and `then'
- Probabilistic stit logic and its decomposition
- Probability logic of finitely additive beliefs
- A dynamic logic of agency. II: Deterministic \({\mathcal{DLA}}\), coalition logic, and game theory
- Expressing discrete spatial relations under granularity
- Existence of certain finite relation algebras implies failure of omitting types for \(L_n\)
- The complexity of identifying characteristic formulae
- Adding the power-set to description logics
- Prioritised ceteris paribus logic for counterfactual reasoning
- The monodic fragment of propositional term modal logic
- Introspection as an action in relational models
- Irreducible equivalence relations, Gleason spaces, and de Vries duality
This page was built for publication: Modal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2744124)