On the public citation graph

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

https://doi.org/10.1007/bf00935601
0 signed · 37 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/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.1017/cbo9780511621192openalex-snapshot
Modal Logic

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.19950410410openalex-snapshot
An Infinitary Graded Modal Logic (Graded Modalities VI)
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-94-017-2798-3_14openalex-snapshot
Translating Graded Modalities into Predicate Logics
inferred← citeshttps://doi.org/10.1007/bf01053022openalex-snapshot
Decidability by filtrations for graded normal logics (graded modalities V)
inferred← citeshttps://doi.org/10.1007/s11466-010-0017-2openalex-snapshot
Toward Model-Theoretic Modal Logics
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.048openalex-snapshot
Introducing Polymodal Neighbourhood Logics
inferred← citeshttps://doi.org/10.1016/j.jal.2010.03.001openalex-snapshot
Complexity of modal logics with Presburger constraints
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.1093/oso/9780192867964.001.0001openalex-snapshot
Fragments of First-Order Logic
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.002.0004openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.002.0005openalex-snapshot
Dedication
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.002.0006openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.002.0009openalex-snapshot
List of Symbols
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0001openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0002openalex-snapshot
Roots
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0003openalex-snapshot
Variables
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0004openalex-snapshot
Guards
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0005openalex-snapshot
Prefixes
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0006openalex-snapshot
Fluting
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0007openalex-snapshot
Counting with one variable
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0008openalex-snapshot
Counting with two variables
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0009openalex-snapshot
Guarded counting
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0010openalex-snapshot
Omitting graphs
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0011openalex-snapshot
Modalities
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0012openalex-snapshot
Equivalence
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0013openalex-snapshot
Equivalence and counting
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0014openalex-snapshot
Transitivity
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0015openalex-snapshot
Trees
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.