On the public citation graph
Every world can see a reflexive world
0 signed · 17 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.1007/978-3-031-39784-4_22openalex-snapshot
Decidability of Modal Logics of Non-k-Colorable Graphs
inferred← citeshttps://doi.org/10.1007/bf01181878openalex-snapshot
Elementary generation and canonicity for varieties of Boolean algebras with operators
inferred← citeshttps://doi.org/10.1007/s11225-015-9611-6openalex-snapshot
A Dichotomy for Some Elementarily Generated Modal Logics
inferred← citeshttps://doi.org/10.1016/j.jal.2010.08.005openalex-snapshot
Axiomatizing hybrid logic using modal logic
inferred← citeshttps://doi.org/10.1016/j.jal.2013.03.007openalex-snapshot
Modal definability of first-order formulas with free variables and query answering
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80008-5openalex-snapshot
5 Model theory of modal logic
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.1080/01445340701690233openalex-snapshot
Jaina Logic: A Contemporary Perspective
inferred← citeshttps://doi.org/10.1090/s0002-9947-04-03743-2openalex-snapshot
Canonical varieties with no canonical axiomatisation
inferred← citeshttps://doi.org/10.1093/jigpal/jzaa068openalex-snapshot
Frame-validity Games and Lower Bounds on the Complexity of Modal Axioms
inferred← citeshttps://doi.org/10.1093/jigpal/jzy018openalex-snapshot
Complexity of finite-variable fragments of propositional modal logics of symmetric frames
inferred← citeshttps://doi.org/10.1305/ndjfl/1168352661openalex-snapshot
Hybrid Formulas and Elementarily Generated Modal Logics
inferred← citeshttps://doi.org/10.2178/bsl/1082986262openalex-snapshot
Erdős Graphs Resolve Fine's Canonicity Problem
inferred← citeshttps://doi.org/10.26686/ajl.v5i0.1783openalex-snapshot
The McKinsey–Lemmon logic is barely canonical
inferred← citeshttps://doi.org/10.26686/ajl.v6i0.1794openalex-snapshot
Modal Formulas True at Some Point in Every Model
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.