On the public citation graph

An algebraic study of well-foundedness

https://doi.org/10.1007/bf00370431
0 signed · 20 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/3-540-09237-4openalex-snapshot
First-Order Dynamic Logic
inferredcites →https://doi.org/10.1007/bf02121661openalex-snapshot
Representation and duality theory for diagonalizable algebras
inferredcites →https://doi.org/10.1017/s0025557200021884openalex-snapshot
Compositio Mathematica
inferredcites →https://doi.org/10.2307/2269810openalex-snapshot
Algebraic semantics for modal logics II
inferredcites →https://doi.org/10.2307/2270619openalex-snapshot
Algebraic semantics for modal logics I
inferredcites →https://doi.org/10.2307/2372074openalex-snapshot
Boolean Algebras with Operators
inferredcites →https://doi.org/10.2307/2372123openalex-snapshot
Boolean Algebras with Operators. Part I
inferredcites →https://doi.org/10.4064/-9-1-31-46openalex-snapshot
A completeness theorem in the modal logic of programs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_49openalex-snapshot
Termination in Modal Kleene Algebra
inferred← citeshttps://doi.org/10.1007/978-3-319-06025-5_12openalex-snapshot
Structures for Epistemic Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-78913-0_16openalex-snapshot
Non-termination in Idempotent Semirings
inferred← citeshttps://doi.org/10.1007/978-94-017-8860-1_3openalex-snapshot
Free Modal Algebras Revisited: The Step-by-Step Method
inferred← citeshttps://doi.org/10.1007/bf00370684openalex-snapshot
Algebraization of quantifier logics, an introductory overview
inferred← citeshttps://doi.org/10.1007/bf01196091openalex-snapshot
Power structures
inferred← citeshttps://doi.org/10.1007/s10992-012-9256-0openalex-snapshot
The Power of a Propositional Constant
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90077-sopenalex-snapshot
A Modal Logic for Cyclic Repeating
inferred← citeshttps://doi.org/10.1016/j.jlap.2005.04.006openalex-snapshot
Kleene under a modal demonic star
inferred← citeshttps://doi.org/10.1145/1166109.1166116openalex-snapshot
Kleene algebra with domain
inferred← citeshttps://doi.org/10.1145/1183278.1183285openalex-snapshot
Kleene algebra with domain
inferred← citeshttps://doi.org/10.2168/lmcs-7(1:1)2011openalex-snapshot
Algebraic Notions of Termination
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.