On the public citation graph

Slanted Canonicity of Analytic Inductive Inequalities

0 signed · 42 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.1006/jabr.2000.8622openalex-snapshot
Bounded Lattice Expansions
inferredcites →https://doi.org/10.1007/11734673_1openalex-snapshot
Topological Representation of Precontact Algebras
inferredcites →https://doi.org/10.1007/978-94-017-1280-4openalex-snapshot
Displaying Modal Logic
inferredcites →https://doi.org/10.1007/bf01057646openalex-snapshot
On the canonicity of Sahlqvist identities
inferredcites →https://doi.org/10.1007/s000120050024openalex-snapshot
Stone duality for lattices
inferredcites →https://doi.org/10.1007/s10472-007-9064-3openalex-snapshot
Region–based theory of discrete spaces: A proximity approach
inferredcites →https://doi.org/10.1007/s10485-016-9434-2openalex-snapshot
Irreducible Equivalence Relations, Gleason Spaces, and de Vries Duality
inferredcites →https://doi.org/10.1007/s11083-010-9168-yopenalex-snapshot
Distributive Lattices with a Generalized Implication: Topological Duality
inferredcites →https://doi.org/10.1016/j.apal.2004.04.007openalex-snapshot
A Sahlqvist theorem for distributive modal logic
inferredcites →https://doi.org/10.1016/j.apal.2011.10.004openalex-snapshot
Algorithmic correspondence and canonicity for distributive modal logic
inferredcites →https://doi.org/10.1016/j.apal.2019.04.003openalex-snapshot
Algorithmic correspondence and canonicity for non-distributive logics
inferredcites →https://doi.org/10.1016/j.ins.2020.05.074openalex-snapshot
Rough concepts
inferredcites →https://doi.org/10.1016/j.jpaa.2006.06.001openalex-snapshot
Canonical extensions of double quasioperator algebras: An algebraic perspective on duality for certain algebras with binary operations
inferredcites →https://doi.org/10.1016/s0168-0072(96)00048-6openalex-snapshot
Constructive canonicity in non-classical logics
inferredcites →https://doi.org/10.1093/logcom/exl026openalex-snapshot
Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
inferredcites →https://doi.org/10.1093/logcom/exv041openalex-snapshot
Jónsson-style canonicity for ALBA-inequalities
inferredcites →https://doi.org/10.1093/logcom/exw014openalex-snapshot
Sahlqvist theory for impossible worlds
inferredcites →https://doi.org/10.1093/logcom/exw022openalex-snapshot
Unified correspondence as a proof-theoretic tool
inferredcites →https://doi.org/10.1145/3632526openalex-snapshot
Algebraic Proof Theory for LE-logics
inferredcites →https://doi.org/10.21136/mb.2001.134115openalex-snapshot
Quasi-modal algebras
inferredcites →https://doi.org/10.2168/lmcs-2(1:5)2006openalex-snapshot
Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
inferredcites →https://doi.org/10.2178/jsl/1122038911openalex-snapshot
Canonical extensions and relational completeness of some substructural logics
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/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.23638/lmcs-15(1:15)2019openalex-snapshot
Sahlqvist via Translation
inferredcites →https://doi.org/10.48550/arxiv.1009.2803openalex-snapshot
A view of canonical extension
inferredcites →https://doi.org/10.48550/arxiv.1603.06547openalex-snapshot
Constructive canonicity for lattice-based fixed point logics
inferredcites →https://doi.org/10.48550/arxiv.2002.04257openalex-snapshot
Non-distributive logics: from semantics to meaning
inferredcites →https://doi.org/10.48550/arxiv.2004.14919openalex-snapshot
Subordination algebras in modal logic
inferredcites →https://doi.org/10.7146/math.scand.a-14428openalex-snapshot
Bounded distributive lattice expansions

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-3-031-15298-6_21openalex-snapshot
Subordination Algebras as Semantic Environment of Input/Output Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-89610-1_8openalex-snapshot
Monotone Modal Logic Beyond Distributivity
inferred← citeshttps://doi.org/10.1007/s11229-025-05207-zopenalex-snapshot
Obligations and permissions on selfextensional logics
inferred← citeshttps://doi.org/10.1016/j.fss.2024.108892openalex-snapshot
Modal reduction principles across relational semantics
inferred← citeshttps://doi.org/10.1017/jsl.2023.7openalex-snapshot
INTUITIONISTIC SAHLQVIST THEORY FOR DEDUCTIVE SYSTEMS
inferred← citeshttps://doi.org/10.1093/jigpal/jzad003openalex-snapshot
Correspondence and canonicity theory of quasi-inequalities andΠ2-statements in modal subordination algebras
inferred← citeshttps://doi.org/10.1145/3529255openalex-snapshot
Syntactic Completeness of Proper Display Calculi
inferred← citeshttps://doi.org/10.1145/3570919openalex-snapshot
Linear Logic Properly Displayed
inferred← citeshttps://doi.org/10.23638/lmcs-16(3:8)2020openalex-snapshot
Constructive Canonicity of Inductive Inequalities
inferred← citeshttps://doi.org/10.48550/arxiv.2004.14919openalex-snapshot
Subordination algebras in 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.