On the public citation graph
A general filtration method for modal logics
0 signed · 31 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.1111/j.1755-2567.1968.tb00336.xopenalex-snapshot
Decidability of four modal logics
inferredcites →https://doi.org/10.1111/j.1755-2567.1970.tb00430.xopenalex-snapshot
Selective filtration in modal logic Part A. Semantic tableaux method
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.19990450409openalex-snapshot
On Finite Model Property for Admissible Rules
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_156openalex-snapshot
A class of information logics with a decidable validity problem
inferred← citeshttps://doi.org/10.1007/978-94-011-4574-9_2openalex-snapshot
Research Themes of Dov Gabbay
inferred← citeshttps://doi.org/10.1007/978-94-015-8242-1_9openalex-snapshot
A Logic with Progressive Tenses
inferred← citeshttps://doi.org/10.1007/bf01418760openalex-snapshot
Modal logics of domains on the real plane
inferred← citeshttps://doi.org/10.1007/bf02259929openalex-snapshot
The decidability of admissibility problems for modal logics S4.2 and S4.2Grz and superintuitionistic logic KC
inferred← citeshttps://doi.org/10.1007/bfb0000489openalex-snapshot
The hidden function question revisited
inferred← citeshttps://doi.org/10.1007/s10849-025-09431-1openalex-snapshot
Comprehension and Knowledge
inferred← citeshttps://doi.org/10.1007/s10958-025-08132-1openalex-snapshot
FINITE MODEL PROPERTY OF PRETRANSITIVE ANALOGUES OF (w)K4 AND GL
inferred← citeshttps://doi.org/10.1007/s11225-025-10207-8openalex-snapshot
Two Types of Filtrations for $${\textsc {wK4}}$$ and Its Relatives
inferred← citeshttps://doi.org/10.1007/s11787-014-0097-1openalex-snapshot
Proofs and Countermodels in Non-Classical Logics
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00190-5openalex-snapshot
Logical analysis of demonic nondeterministic programs
inferred← citeshttps://doi.org/10.1016/j.jal.2014.08.002openalex-snapshot
Products of modal logics and tensor products of modal algebras
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70728-6openalex-snapshot
Completeness and Correspondence in the First and Second Order Semantics for Modal Logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00157-6openalex-snapshot
A class of decidable information logics
inferred← citeshttps://doi.org/10.1017/jsl.2026.10248openalex-snapshot
KNOCKING DOWN BOXES: THE FMP FOR K ⊕ ◻ m + k p → ◻ m p $\mathbf {K}\oplus \Box ^{m+k} p\to \Box ^m p$ bold upper K circled plus white medium square Superscript m plus k Baseline p right arrow white medium square Superscript m Baseline p
inferred← citeshttps://doi.org/10.1023/a:1012557903153openalex-snapshot
Residual Finiteness for Admissible Inference Rules
inferred← citeshttps://doi.org/10.1070/im8476openalex-snapshot
Partitioning Kripke frames of finite height
inferred← citeshttps://doi.org/10.1093/jigpal/jzaf097openalex-snapshot
PSPACE-completeness of bimodal transitive weak-density logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzm010openalex-snapshot
An Axiomatisation for the Multi-modal Logic of Knowledge and Linear Time LTK
inferred← citeshttps://doi.org/10.1093/logcom/exag023openalex-snapshot
Stable canonical rules and formulas for pre-transitive logics via definable filtration
inferred← citeshttps://doi.org/10.1109/lics.2012.42openalex-snapshot
Countermodels from Sequent Calculi in Multi-Modal Logics
inferred← citeshttps://doi.org/10.1305/ndjfl/1093888510openalex-snapshot
Putting ${\cal K}$ in its place.
inferred← citeshttps://doi.org/10.1609/aaai.v35i13.17382openalex-snapshot
Comprehension and Knowledge
inferred← citeshttps://doi.org/10.2307/2275363openalex-snapshot
Nonmonotonic consequence based on intuitionistic logic
inferred← citeshttps://doi.org/10.24963/ijcai.2022/805openalex-snapshot
Intelligence in Strategic Games (Extended Abstract)
inferred← citeshttps://doi.org/10.4213/im8476openalex-snapshot
О разбиениях шкал Крипке конечной высоты
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.