On the public citation graph
Syntax and semantics of modal logics containing S4
0 signed · 38 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 this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1090/s0002-9939-1951-0045695-9openalex-snapshot
The Extended Centralizer of a Ring Over a Module
inferredcites →https://doi.org/10.1111/j.1755-2567.1974.tb00081.xopenalex-snapshot
An ascending chain of S4 logics
inferredcites →https://doi.org/10.1111/j.1755-2567.1977.tb00779.xopenalex-snapshot
Five critical modal systems
inferredcites →https://doi.org/10.1112/jlms/s1-41.1.572openalex-snapshot
THE MATHEMATICS OF METAMATHEMATICS
inferredcites →https://doi.org/10.2307/2372123openalex-snapshot
Boolean Algebras with Operators. Part I
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19950410103openalex-snapshot
All Finitely Axiomatizable Normal Extensions of K4.3 are Decidable
inferred← citeshttps://doi.org/10.1007/978-94-015-8242-1_7openalex-snapshot
How Completeness and Correspondence Theory Got Married
inferred← citeshttps://doi.org/10.1007/978-94-015-8879-9_8openalex-snapshot
Canonical Formulas for Modal and Superintuitionistic Logics: A Short Outline
inferred← citeshttps://doi.org/10.1007/bf00370182openalex-snapshot
The disjunction property of intermediate propositional logics
inferred← citeshttps://doi.org/10.1007/bf00370331openalex-snapshot
Modal companions of intermediate propositional logics
inferred← citeshttps://doi.org/10.1007/bf01982017openalex-snapshot
Syntax and semantics of superintutionistic logics
inferred← citeshttps://doi.org/10.1007/s10469-010-9107-4openalex-snapshot
Generalized Kripke semantics for Nelson’s logic
inferred← citeshttps://doi.org/10.1007/s11787-012-0048-7openalex-snapshot
Characteristic Formulas of Partial Heyting Algebras
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.006openalex-snapshot
Algebras and General Frames
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.007openalex-snapshot
Computability and Complexity
inferred← citeshttps://doi.org/10.1017/cbo9781107050884.012openalex-snapshot
A Guide to the Literature
inferred← citeshttps://doi.org/10.1023/a:1005219831286openalex-snapshot
Kripke Incompleteness of Predicate Extensions of the Modal Logics Axiomatized by a Canonical Formula for a Frame with a Nontrivial Cluster
inferred← citeshttps://doi.org/10.1215/00294527-3691563openalex-snapshot
Locally Finite Reducts of Heyting Algebras and Canonical Formulas
inferred← citeshttps://doi.org/10.2307/2275108openalex-snapshot
The undecidability of the disjunction property of propositional logics and other related problems
inferred← citeshttps://doi.org/10.2307/2275372openalex-snapshot
Canonical formulas for K4. Part I: Basic results
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.