On the public citation graph

Graded modalities. III (the completeness and compactness of S40)

0 signed · 23 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/bf00374047openalex-snapshot

Graded modalities, II (canonical models)

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

Graded modalities. I

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-1-4613-1461-5_3openalex-snapshot

A Review of Rough Set Models

inferred← citeshttps://doi.org/10.1007/978-3-030-29566-0_2openalex-snapshot

Overview of Rough Set Theory

inferred← citeshttps://doi.org/10.1007/978-3-319-40581-0_13openalex-snapshot

Negation of Graded Beliefs

inferred← citeshttps://doi.org/10.1007/978-3-319-72691-5_4openalex-snapshot

Logical Characterizations of Rough Sets

inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_12openalex-snapshot

An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees

inferred← citeshttps://doi.org/10.1007/978-3-662-47197-5_4openalex-snapshot

Finite-Chain Graded Modal Logic

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-2798-3_14openalex-snapshot

Translating Graded Modalities into Predicate Logics

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

Normal predicative logics with graded modalities

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

General canonical models for graded normal logics (graded modalities IV)

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

Generalized quantifiers and modal logic

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

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

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

Graded modalities in epistemic 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.2017.06.011openalex-snapshot

Typology of axioms for a weighted modal logic

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

A Note on Graded Modal Logic

inferred← citeshttps://doi.org/10.1080/11663081.2024.2336385openalex-snapshot

A study of modal logic with semantics based on rough set theory

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.1109/nafips.2001.944362openalex-snapshot

On modal fuzzy approximate reasoning

inferred← citeshttps://doi.org/10.1145/3733832openalex-snapshot

On the Logical and Algebraic Aspects of Reasoning with Formal Contexts

inferred← citeshttps://doi.org/10.3233/fun-2008-851-405openalex-snapshot

A Logic for Reasoning about Persuasion

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.