The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
An Introduction to Mathematical Logic
(2005) · Discrete Algorithmic Mathematics · doi:10.1201/b13782-17 · Cited by 1,732
M., G. B. (1911) · Nature · doi:10.1038/087273a0 · Cited by 994
Boolean Algebras with Operators. Part I
Jónsson, B., & Tarski, A. (1951) · American Journal of Mathematics · doi:10.2307/2372123 · Cited by 772
Research works printed but not linked: 18
- 10.2307/2964568 · doi:10.2307/2964568
- von Wright G. H., 1951, An essay in modal logic
- Lewis C. I., 1932, Symbolic logic
- Beth E. W., 1955, Semantic entailment and formal derivability, Mededelingen der Kon. Nederl. Akad. Wetensch., Afd. Letterkunde, n.s., 18, 309
- Bayart A., 1959, Quasi‐adequation de la logique modale de second ordre S5 et adequation de la logique de premier ordre S5, Logique et Analyse, 2
- Kripke Saul A., 1959, Semantical analysis of modal logic (abstract), Jour. Symb. Logic, 24, 323
- Guillaume Marcel, 1958, Rapports entre calculs propositionels modaux et topologie impliques par certain extensions de la methode des tableaux semantiques, C. R. Acad. Sci., Paris, 246, 1140
- 10.2307/2267027 · doi:10.2307/2267027
- Ohnishi Masao, 1957, Gentzen method in modal calculi, Osaka Math. J., 9, 113
- 1959, Osaka Math. J., 11, 115
- 10.2307/2268619 · doi:10.2307/2268619
- Prior A. N., 1957, Time and modality
- 10.2307/2268135 · doi:10.2307/2268135
- Halldén Sören, 1957, On the semantic non‐completeness of certain Lewis calculi, Jour. Symb. Logic, 14, 127
- 10.1305/ndjfl/1093956424 · doi:10.1305/ndjfl/1093956424
- 10.3406/phlou.1937.3056 · doi:10.3406/phlou.1937.3056
- 10.3406/phlou.1938.3890 · doi:10.3406/phlou.1938.3890
- Dummett M. A. E., 1958, Modal logics between S4 and S5, This Zeitschr., 4, 250
Cited by
Intelligent agents: theory and practice
Wooldridge, M., & Jennings, N. R. (1995) · The Knowledge Engineering Review · doi:10.1017/s0269888900008122 · Cited by 6,810
The temporal logic of programs
Pnueli, A. (1977) · 18th Annual Symposium on Foundations of Computer Science (sfcs 1977) · doi:10.1109/sfcs.1977.32 · Cited by 5,689
Some Philosophical Problems from the Standpoint of Artificial Intelligence
McCarthy, J., & Hayes, P. J. (1981) · Readings in Artificial Intelligence · doi:10.1016/b978-0-934613-03-3.50033-7 · Cited by 3,279
Stalnaker, R. C. (1968) · IFS · doi:10.1007/978-94-009-9117-0_2 · Cited by 2,220
Shoham, Y. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90034-9 · Cited by 2,041
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
Self-citationAgent theories, architectures, and languages: A survey
Wooldridge, M., & Jennings, N. R. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-58855-8_1 · Cited by 1,363
Belief, awareness, and limited reasoning
Fagin, R., & Halpern, J. Y. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90003-8 · Cited by 885
A guide to completeness and complexity for modal logics of knowledge and belief
Halpern, J. Y., & Moses, Y. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90049-4 · Cited by 845
PRUF—a meaning representation language for natural languages
Zadeh, L. A. (1978) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(78)80003-0 · Cited by 724
Reasoning about knowledge and probability
Fagin, R., & Halpern, J. Y. (1994) · Journal of the ACM · doi:10.1145/174652.174658 · Cited by 477
Boolos, G. S. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9780511625183 · Cited by 427
Maschler, M., Solan, E., & Zamir, S. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9780511794216 · Cited by 369
Decision procedures for BDI logics
Rao, A. (1998) · Journal of Logic and Computation · doi:10.1093/logcom/8.3.293 · Cited by 340
A modal analysis of staged computation
Davies, R., & Pfenning, F. (2001) · Journal of the ACM · doi:10.1145/382780.382785 · Cited by 293
THE SYNTHESIS OF DIGITAL MACHINES WITH PROVABLE EPISTEMIC PROPERTIES
Rosenschein, S. J., & Kaelbling, L. P. (1986) · Theoretical Aspects of Reasoning About Knowledge · doi:10.1016/b978-0-934613-04-0.50009-0 · Cited by 282
On Databases with Incomplete Information
Lipski, W. (1981) · Journal of the ACM · doi:10.1145/322234.322239 · Cited by 275
Logical Concepts of (Im)possibility Guide Young Children's Decision‐Making
Cesana‐Arlotti, N., Jáuregui, S., Mazalik, P., Nichols, S., & Halberda, J. (2025) · Developmental Science · doi:10.1111/desc.70044 · Cited by 6
Metadata
- Authors
- Kripke, S. A.
- Venue
- Mathematical Logic Quarterly
- Publisher
- Wiley
- Published
- 1963-01
- Volume
- 9
- Issue
- 5-6
- Pages
- 67-96
- ISSN
- 0044-3050 (ISSN-L)
- 0942-5616
- 1521-3870
- OpenAlex
- W2075277371
- Cited by
- 1,287
- References
- 3
- FWCI
- 7.76
- Type
- journal article
- 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
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.