On the public citation graph

A classification of modal logics

0 signed · 18 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/malq.19660120129openalex-snapshot

That All Normal Extensions of S4.3 Have the Finite Model Property

inferredcites →https://doi.org/10.1002/malq.19710170141openalex-snapshot

The Logics Containing S 4.3

inferredcites →https://doi.org/10.1007/bf01668576openalex-snapshot

Pretabular extensions of LewisS4

inferredcites →https://doi.org/10.1007/bf01674781openalex-snapshot

Modal logics with LM-axioms

inferredcites →https://doi.org/10.1111/j.1755-2567.1974.tb00081.xopenalex-snapshot

An ascending chain of S4 logics

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-540-45220-1_32openalex-snapshot

Complexity of Some Problems in Modal and Intuitionistic Calculi

inferred← citeshttps://doi.org/10.1007/bf00370682openalex-snapshot

Amalgamation and interpolation in normal modal logics

inferred← citeshttps://doi.org/10.1007/bf00970916openalex-snapshot

Continuum of normal extensions of the modal logic of provability with the interpolation property

inferred← citeshttps://doi.org/10.1007/bf01669837openalex-snapshot

Interpolation theorems in modal logics. Sufficient conditions

inferred← citeshttps://doi.org/10.1007/bf01673502openalex-snapshot

Interpolation theorems in modal logics and amalgamable varieties of topological Boolean algebras

inferred← citeshttps://doi.org/10.1007/s10469-012-9177-6openalex-snapshot

Interpolation in weakly transitive modal logics

inferred← citeshttps://doi.org/10.1007/s11202-010-0045-0openalex-snapshot

Interpolation properties in the extensions of the logic of inequality

inferred← citeshttps://doi.org/10.1007/s11225-006-8309-1openalex-snapshot

Projective Beth Property in Extensions of Grzegorczyk Logic

inferred← citeshttps://doi.org/10.1016/s0168-0072(99)00032-9openalex-snapshot

Best solving modal equations

inferred← citeshttps://doi.org/10.1017/9781316755785.009openalex-snapshot

Decidable properties of logical calculi and of varieties of algebras

inferred← citeshttps://doi.org/10.1023/a:1026447418461openalex-snapshot

Bull's Theorem by the Method of Diagrams

inferred← citeshttps://doi.org/10.2178/jsl/1096901773openalex-snapshot

Filtering unification and most general unifiers in modal logic

inferred← citeshttps://doi.org/10.2307/2274323openalex-snapshot

Cylindric-relativised set algebras have strong amalgamation

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.