On the public citation graph
Saul A. Kripke. Semantical analysis of modal logic I. Normal modal propositional calculi. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 9 (1963), pp. 67–96.
0 signed · 29 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/game.2000.0832openalex-snapshot
Alternative Semantics for Unawareness
inferred← citeshttps://doi.org/10.1006/jeth.2002.2925openalex-snapshot
Characterizing the Common Prior Assumption
inferred← citeshttps://doi.org/10.1007/978-3-031-40714-7_6openalex-snapshot
Propositional Modal Axiom Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57635-5_2openalex-snapshot
Saul Kripke: A Portrait of the Modal Logician as a Young Man
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_4openalex-snapshot
Unified Classical Logic Completeness
inferred← citeshttps://doi.org/10.1007/978-3-642-32024-8_12openalex-snapshot
Plural Quantifications and Generalized Quantifiers
inferred← citeshttps://doi.org/10.1007/978-94-009-2727-8_10openalex-snapshot
Generalized Quantifiers and Natural Language
inferred← citeshttps://doi.org/10.1007/978-94-009-9056-2_8openalex-snapshot
Modal and Relevance Logics: 1977
inferred← citeshttps://doi.org/10.1007/bf00350139openalex-snapshot
Generalized quantifiers and natural language
inferred← citeshttps://doi.org/10.1007/s10817-016-9391-3openalex-snapshot
Soundness and Completeness Proofs by Coinductive Methods
inferred← citeshttps://doi.org/10.1007/s11229-005-5514-9openalex-snapshot
Meredith, Prior, and the History of Possible Worlds Semantics
inferred← citeshttps://doi.org/10.1016/0004-3702(92)90049-4openalex-snapshot
A guide to completeness and complexity for modal logics of knowledge and belief
inferred← citeshttps://doi.org/10.1016/j.dss.2006.02.012openalex-snapshot
A logical framework for identifying quality knowledge from different data sources
inferred← citeshttps://doi.org/10.1016/j.ijar.2023.109033openalex-snapshot
An (almost) fuzzy logic of action and preferences, its quasi-model interpretations, and the problem of its decidability
inferred← citeshttps://doi.org/10.1016/s1570-8683(03)00008-9openalex-snapshot
Mathematical modal logic: A view of its evolution
inferred← citeshttps://doi.org/10.1016/s1874-5857(06)80027-0openalex-snapshot
Mathematical modal logic: A view of its evolution
inferred← citeshttps://doi.org/10.1023/a:1015273407895openalex-snapshot
The Genesis of Possible Worlds Semantics
inferred← citeshttps://doi.org/10.1023/a:1020803514176openalex-snapshot
Some Properties of Natural Language Quantifiers: Generalized Quantifier Theory
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780195367881.003.0002openalex-snapshot
CHAPTER 2 David Kaplan: Formal Aspects of His Work
inferred← citeshttps://doi.org/10.1111/j.1755-2567.1968.tb00335.xopenalex-snapshot
Decidability of S4.1
inferred← citeshttps://doi.org/10.1111/j.1755-2567.1969.tb00372.xopenalex-snapshot
Logics With Several Modal Operators
inferred← citeshttps://doi.org/10.1111/j.1755-2567.1971.tb00061.xopenalex-snapshot
Completeness and decidability of three logics of counterfactual conditionals1
inferred← citeshttps://doi.org/10.54337/lpt.v5i1.7853openalex-snapshot
On A.N. Prior’s Logical System Q
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.