The DOI matches its Crossref record; 62 of the 62 references it cites were found in a registry or an index.
Modal Logic
Abstract
This is an advanced 2001 textbook on modal logic, a field which caught the attention of computer scientists in the late 1970s. Researchers in areas ranging from economics to computational linguistics have since realised its worth. The book is for novices and for more experienced readers, with two distinct tracks clearly signposted at the start of each chapter. The development is mathematical; prior acquaintance with first-order logic and its semantics is assumed, and familiarity with the basic mathematical notions of set theory is required. The authors focus on the use of modal languages as tools to analyze the properties of relational structures, including their algorithmic and algebraic aspects, and applications to issues in logic and computer science such as completeness, computability and complexity are considered. Three appendices supply basic background information and numerous exercises are provided. Ideal for anyone wanting to learn modern modal logic.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Intelligent agents: theory and practice
Wooldridge, M., & Jennings, N. R. (1995) · The Knowledge Engineering Review · doi:10.1017/s0269888900008122 · Cited by 6,810
(1994) · Mathematical Social Sciences · doi:10.1016/0165-4896(94)90005-1 · Cited by 3,517
On the logic of theory change: Partial meet contraction and revision functions
Alchourrón, C. E., Gärdenfors, P., & Makinson, D. (1985) · Journal of Symbolic Logic · doi:10.2307/2274239 · Cited by 3,222
The Lambda Calculus - Its Syntax and Semantics
(1984) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/c2009-0-14341-6 · Cited by 2,787
Theory of Recursive Functions and Effective Computability
Cooper, D. C. (1969) · The Computer Journal · doi:10.1093/comjnl/12.1.28 · Cited by 2,539
A Mathematical Introduction to Logic
(2001) · Elsevier eBooks · doi:10.1016/c2009-0-22107-6 · Cited by 2,387
Burris, S., & Sankappanavar, H. P. (1981) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-8130-3 · Cited by 2,027
Chellas, B. F. (1980) · Cited by 1,806
Semantical Considerations on Modal Logic
Kripke, S. A. (2012) · Universal Logic: An Anthology · doi:10.1007/978-3-0346-0145-0_16 · Cited by 1,585
Propositional dynamic logic of regular programs
Fischer, M. J., & Ladner, R. E. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90046-1 · Cited by 1,193
Cited by
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
Baader, F. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03754-2_1 · Cited by 427
Relationship-based access control: protection model and policy language
Fong, P. W. L. (2011) · Proceedings of the first ACM conference on Data and application security and privacy · doi:10.1145/1943513.1943539 · Cited by 267
Rendsvig, R. K. (2014) · Synthese · doi:10.1007/s11229-014-0435-0 · Cited by 32
Metadata
- Authors
- Blackburn, P., Rijke, M. D., & Venema, Y.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 2001-06-28
- OpenAlex
- W4211144022
- Cited by
- 1,689
- References
- 62
- FWCI
- 6.41
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Modal Logic. https://app.cochat.ai/papers/10.1017/cbo9781107050884
- The paper
- Blackburn, P., Rijke, M. D., & Venema, Y. (2001). Modal Logic. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9781107050884
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.