On the public citation graph

Decidability by filtrations for graded normal logics (graded modalities V)

https://doi.org/10.1007/bf01053022
0 signed · 32 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/bf00293428openalex-snapshot
Decidability and the finite model property
inferredcites →https://doi.org/10.1007/bf00370285openalex-snapshot
Graded modalities. III (the completeness and compactness of S40)
inferredcites →https://doi.org/10.1007/bf00374047openalex-snapshot
Graded modalities, II (canonical models)
inferredcites →https://doi.org/10.1007/bf00379767openalex-snapshot
Graded modalities. I
inferredcites →https://doi.org/10.1007/bf00935601openalex-snapshot
General canonical models for graded normal logics (graded modalities IV)
inferredcites →https://doi.org/10.1017/cbo9780511621192openalex-snapshot
Modal Logic
inferredcites →https://doi.org/10.1111/j.1755-2567.1968.tb00335.xopenalex-snapshot
Decidability of S4.1
inferredcites →https://doi.org/10.1111/j.1755-2567.1968.tb00336.xopenalex-snapshot
Decidability of four modal logics
inferredcites →https://doi.org/10.1305/ndjfl/1093890715openalex-snapshot
In so many possible worlds.
inferredcites →https://doi.org/10.2307/2266324openalex-snapshot
On axiomatizability within a system

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11814771_44openalex-snapshot
Presburger Modal Logic Is PSPACE-Complete
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-3-540-75560-9_23openalex-snapshot
How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited
inferred← citeshttps://doi.org/10.1007/978-3-662-66544-2_4openalex-snapshot
Granularity and Rational Approximation: Rethinking Graded Rough Sets
inferred← citeshttps://doi.org/10.1007/978-94-017-0454-0_2openalex-snapshot
Advanced Modal Logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.048openalex-snapshot
Introducing Polymodal Neighbourhood Logics
inferred← citeshttps://doi.org/10.1016/j.ijar.2011.10.003openalex-snapshot
Comparative study of variable precision rough set model and graded rough set model
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.09.007openalex-snapshot
Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete
inferred← citeshttps://doi.org/10.1016/j.jal.2010.03.001openalex-snapshot
Complexity of modal logics with Presburger constraints
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00157-6openalex-snapshot
A class of decidable information logics
inferred← citeshttps://doi.org/10.1023/a:1004956418185openalex-snapshot
Kripke Frame with Graded Accessibility and Fuzzy Possible World Semantics
inferred← citeshttps://doi.org/10.1023/a:1005245900406openalex-snapshot
A Note on Graded Modal Logic
inferred← citeshttps://doi.org/10.1023/a:1026499402531openalex-snapshot
Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of ♦-Formulae
inferred← citeshttps://doi.org/10.1109/cise.2009.5364945openalex-snapshot
Model of Logical Difference Operation of Grade Upper Approximation Operator and Variable Precision Lower Approximation Operator
inferred← citeshttps://doi.org/10.1109/fskd.2017.8393053openalex-snapshot
The graded multi-granulation rough set based on interval-valued fuzzy information system
inferred← citeshttps://doi.org/10.1109/icicisys.2009.5357752openalex-snapshot
Model of logical or operation of variable precision lower approximation operator and grade upper approximation operator
inferred← citeshttps://doi.org/10.1109/iciecs.2009.5362798openalex-snapshot
Product Operation of Grade Upper Approximation Operator and Grade Lower Approximation Operator Based on Two Parameters
inferred← citeshttps://doi.org/10.1109/iciecs.2009.5363547openalex-snapshot
Model of Logical Difference Operation of Grade Lower Approximation Operator and Variable Precision Upper Approximation Operator
inferred← citeshttps://doi.org/10.1109/lics.2009.17openalex-snapshot
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
inferred← citeshttps://doi.org/10.1145/3733832openalex-snapshot
On the Logical and Algebraic Aspects of Reasoning with Formal Contexts
inferred← citeshttps://doi.org/10.18778/0138-0680.2021.12openalex-snapshot
Neighbourhood Semantics for Graded Modal Logic
inferred← citeshttps://doi.org/10.5463/thesis.149openalex-snapshot
Semantically informed methods in structural proof theory
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.