On the public citation graph
Sahlqvist's theorem for boolean algebras with operators with an application to cylindric algebras
0 signed · 55 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00370684openalex-snapshot
Algebraization of quantifier logics, an introductory overview
inferredcites →https://doi.org/10.1007/bf01057646openalex-snapshot
On the canonicity of Sahlqvist identities
inferredcites →https://doi.org/10.1016/0168-0072(89)90032-8openalex-snapshot
Varieties of complex algebras
inferredcites →https://doi.org/10.1016/s0049-237x(08)70728-6openalex-snapshot
Completeness and Correspondence in the First and Second Order Semantics for Modal Logic
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7035-1openalex-snapshot
Proceedings of the Third Scandinavian Logic Symposium
inferredcites →https://doi.org/10.1090/s0002-9947-1982-0662049-7openalex-snapshot
Some Varieties Containing Relation Algebras
inferredcites →https://doi.org/10.1090/s0002-9947-1988-0961607-5openalex-snapshot
A Stone Type Representation Theorem for Algebras of Relations of Higher Rank
inferredcites →https://doi.org/10.2307/2274406openalex-snapshot
Johan van Benthem. Modal logic and classical logic. Indices, no. 3. Bibliopolis, Naples 1985 (©1983), also distributed by Humanities Press, Atlantic Highlands, N.J., 234 pp.
inferredcites →https://doi.org/10.2307/2274758openalex-snapshot
A new proof of Sahlqvist's theorem on modal definability and completeness
inferredcites →https://doi.org/10.2307/2372123openalex-snapshot
Boolean Algebras with Operators. Part I
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.200410022openalex-snapshot
Bounded distributive lattices with strict implication
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_66openalex-snapshot
Completeness results for two-sorted metric temporal logics
inferred← citeshttps://doi.org/10.1007/978-1-4020-5587-4_3openalex-snapshot
Axioms, Algebras and Topology
inferred← citeshttps://doi.org/10.1007/978-1-4615-5261-1_3openalex-snapshot
A Fuzzy Modal Logic for Similarity Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-030-76920-8_4openalex-snapshot
Topological Duality and Algebraic Completions
inferred← citeshttps://doi.org/10.1007/978-3-030-88701-8_8openalex-snapshot
Algorithmic Correspondence for Relevance Logics, Bunched Implication Logics, and Relation Algebras via an Implementation of the Algorithm PEARL
inferred← citeshttps://doi.org/10.1007/978-3-540-24771-5_13openalex-snapshot
SCAN Is Complete for All Sahlqvist Formulae
inferred← citeshttps://doi.org/10.1007/978-3-642-04639-1_20openalex-snapshot
Discrete Duality for Relation Algebras and Cylindric Algebras
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_13openalex-snapshot
Some Sahlqvist Completeness Results for Coalgebraic Logics
inferred← citeshttps://doi.org/10.1007/s00012-007-2032-2openalex-snapshot
Topo-canonical completions of closure algebras and Heyting algebras
inferred← citeshttps://doi.org/10.1007/s00012-011-0154-zopenalex-snapshot
On canonicity of poset expansions
inferred← citeshttps://doi.org/10.1007/s00012-018-0562-4openalex-snapshot
Canonical extensions and ultraproducts of polarities
inferred← citeshttps://doi.org/10.1007/s11225-012-9396-9openalex-snapshot
Extending Łukasiewicz Logics with a Modality: Algebraic Approach to Relational Semantics
inferred← citeshttps://doi.org/10.1016/j.apal.2004.04.007openalex-snapshot
A Sahlqvist theorem for distributive modal logic
inferred← citeshttps://doi.org/10.1016/j.apal.2005.10.005openalex-snapshot
Elementary canonical formulae: extending Sahlqvist’s theorem
inferred← citeshttps://doi.org/10.1016/j.apal.2019.04.003openalex-snapshot
Algorithmic correspondence and canonicity for non-distributive logics
inferred← citeshttps://doi.org/10.1016/j.fss.2024.108892openalex-snapshot
Modal reduction principles across relational semantics
inferred← citeshttps://doi.org/10.1016/j.jlamp.2016.10.006openalex-snapshot
Algebraic modal correspondence: Sahlqvist and beyond
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00032-3openalex-snapshot
Notions of density that imply representability in algebraic logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00324-6openalex-snapshot
Two-sorted metric temporal logics
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80010-3openalex-snapshot
7 Modal decision problems
inferred← citeshttps://doi.org/10.1016/s1570-8683(03)00008-9openalex-snapshot
Mathematical modal logic: A view of its evolution
inferred← citeshttps://doi.org/10.1016/s1874-5857(06)80027-0openalex-snapshot
Mathematical modal logic: A view of its evolution
inferred← citeshttps://doi.org/10.1017/s1755020310000201openalex-snapshot
CANONICITY RESULTS OF SUBSTRUCTURAL AND LATTICE-BASED LOGICS
inferred← citeshttps://doi.org/10.1017/s1755020313000026openalex-snapshot
A SAHLQVIST THEOREM FOR SUBSTRUCTURAL LOGIC
inferred← citeshttps://doi.org/10.1023/a:1005204532371openalex-snapshot
Weakly Associative Relation Algebras with Polyadic Composition Operations
inferred← citeshttps://doi.org/10.1093/jigpal/8.4.393openalex-snapshot
Algebraic polymodal logic: a survey
inferred← citeshttps://doi.org/10.1093/jigpal/jzv018openalex-snapshot
Meet-completions and ordered domain algebras
inferred← citeshttps://doi.org/10.1093/logcom/exl026openalex-snapshot
Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
inferred← citeshttps://doi.org/10.13140/rg.2.1.2560.4082openalex-snapshot
Correspondence and Canonicity in Non-Classical Logic
inferred← citeshttps://doi.org/10.2178/bsl/1082986262openalex-snapshot
Erdős Graphs Resolve Fine's Canonicity Problem
inferred← citeshttps://doi.org/10.25560/27689openalex-snapshot
Completeness-via-canonicity in coalgebraic logics
inferred← citeshttps://doi.org/10.3166/jancl.18.175-211openalex-snapshot
IV. Semantic extensions of SQEMA
inferred← citeshttps://doi.org/10.3233/fun-2009-92401openalex-snapshot
Algorithmic Correspondence and Completeness in Modal Logic. III. Extensions of the Algorithm SQEMA with Substitutions
inferred← citeshttps://doi.org/10.48550/arxiv.2004.14919openalex-snapshot
Subordination algebras in modal logic
inferred← citeshttps://doi.org/10.48550/arxiv.2108.06603openalex-snapshot
Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras: the algorithm PEARL and its implementation (Technical Report)
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.