On the public citation graph

A Remark on Boolean Algebras with Operators

0 signed · 11 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/mana.19700460105openalex-snapshot
Completions of B OOLEAN Algebras with operators
inferred← citeshttps://doi.org/10.1007/978-3-319-40370-0_11openalex-snapshot
Coalgebraic Completeness-via-Canonicity
inferred← citeshttps://doi.org/10.1007/978-3-7908-1828-4_12openalex-snapshot
An Application of Standard BAO Theory to Some Abstract Information Algebras
inferred← citeshttps://doi.org/10.1007/978-94-017-0697-1_6openalex-snapshot
A Survey of Boolean Algebras with Operators
inferred← citeshttps://doi.org/10.1007/bf01057646openalex-snapshot
On the canonicity of Sahlqvist identities
inferred← citeshttps://doi.org/10.1007/s00012-012-0196-xopenalex-snapshot
Preservation of Sahlqvist fixed point equations in completions of relativized fixed point Boolean algebras with operators
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90064-0openalex-snapshot
Relation algebras: Concept of points and representability
inferred← citeshttps://doi.org/10.1016/j.apal.2004.04.007openalex-snapshot
A Sahlqvist theorem for distributive modal logic
inferred← citeshttps://doi.org/10.1093/logcom/exw014openalex-snapshot
Sahlqvist theory for impossible worlds
inferred← citeshttps://doi.org/10.25560/27689openalex-snapshot
Completeness-via-canonicity in coalgebraic logics
inferred← citeshttps://doi.org/10.7146/math.scand.a-14428openalex-snapshot
Bounded distributive lattice expansions
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.