On the public citation graph

Cut-free tableau calculi for some propositional normal modal logics

https://doi.org/10.1007/bf00370840
0 signed · 15 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.1007/978-94-009-6259-0_1openalex-snapshot
Basic Modal Logic
inferredcites →https://doi.org/10.1007/bf00249258openalex-snapshot
Modal tableau calculi and interpolation
inferredcites →https://doi.org/10.1007/bf01057938openalex-snapshot
Cut-free sequent and tableau systems for propositional Diodorean modal 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-030-64187-0_10openalex-snapshot
Modal Logics that Bound the Circumference of Transitive Frames
inferred← citeshttps://doi.org/10.1007/978-94-017-8860-1_8openalex-snapshot
Constructive Modalities with Provability Smack
inferred← citeshttps://doi.org/10.1007/s11225-012-9432-9openalex-snapshot
Cut-elimination for Weak Grzegorczyk Logic Go
inferred← citeshttps://doi.org/10.1016/j.apal.2009.05.013openalex-snapshot
Around provability logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.05.027openalex-snapshot
Admissibility of Cut in Coalgebraic Logics
inferred← citeshttps://doi.org/10.1016/j.ic.2009.11.008openalex-snapshot
Cut elimination in coalgebraic logics
inferred← citeshttps://doi.org/10.1016/j.indag.2017.10.003openalex-snapshot
Lewis meets Brouwer: Constructive strict implication
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.10.004openalex-snapshot
Hypersequent rules with restricted contexts for propositional modal logics
inferred← citeshttps://doi.org/10.1023/a:1008237600846openalex-snapshot
Speaking about Transitive Frames in Propositional Languages
inferred← citeshttps://doi.org/10.1093/jigpal/jzac081openalex-snapshot
Non-contingency in a paraconsistent setting
inferred← citeshttps://doi.org/10.1093/logcom/exn087openalex-snapshot
A Non-finitary Sentential Logic that is Elementarily Algebraizable
inferred← citeshttps://doi.org/10.25911/5d626d13dfdbfopenalex-snapshot
Cut-elimination for provability logics and some results in display logic
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.