On the public citation graph

On Sahlqvist theory for hybrid logics

https://doi.org/10.1093/logcom/exv045
0 signed · 48 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/978-3-319-06025-5_36openalex-snapshot
Unified Correspondence
inferredcites →https://doi.org/10.1007/bf01054038openalex-snapshot
Modal logic with names
inferredcites →https://doi.org/10.1007/s000120050100openalex-snapshot
The preservation of Sahlqvist equations in completions of Boolean algebras with operators
inferredcites →https://doi.org/10.1007/s11225-006-8301-9openalex-snapshot
Modal Frame Correspondences and Fixed-Points
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.2005.10.005openalex-snapshot
Elementary canonical formulae: extending Sahlqvist’s theorem
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.entcs.2009.02.035openalex-snapshot
Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA
inferredcites →https://doi.org/10.1016/j.tcs.2014.10.027openalex-snapshot
Algorithmic correspondence for intuitionistic modal mu-calculus
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.1017/cbo9780511809088openalex-snapshot
Introduction to Lattices and Order
inferredcites →https://doi.org/10.1017/cbo9781107050884openalex-snapshot
Modal Logic
inferredcites →https://doi.org/10.1090/s0002-9947-05-03816-xopenalex-snapshot
MacNeille completions and canonical extensions
inferredcites →https://doi.org/10.1093/jigpal/8.3.339openalex-snapshot
Representation, reasoning, and relational structures: a hybrid logic manifesto
inferredcites →https://doi.org/10.1093/jigpal/jzi024openalex-snapshot
Hybrid logics with Sahlqvist axioms
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/1107298517openalex-snapshot
Interpolation for extended modal languages
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.

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-662-52921-8openalex-snapshot
Informational cascades: A test for rationality?
inferred← citeshttps://doi.org/10.1007/978-3-662-52921-8_10openalex-snapshot
Categories: How I Learned to Stop Worrying and Love Two Sorts
inferred← citeshttps://doi.org/10.1007/978-3-662-55386-2_11openalex-snapshot
Lattice Logic Properly Displayed
inferred← citeshttps://doi.org/10.1007/978-3-662-55386-2_28openalex-snapshot
Algorithmic Sahlqvist Preservation for Modal Compact Hausdorff Spaces
inferred← citeshttps://doi.org/10.1007/978-3-662-55386-2_7openalex-snapshot
Constructive Canonicity for Lattice-Based Fixed Point Logics
inferred← citeshttps://doi.org/10.1007/978-981-15-1342-8_6openalex-snapshot
Algebraic Semantics for Hybrid Logics
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.apal.2025.103635openalex-snapshot
Unified inverse correspondence for LE-logics
inferred← citeshttps://doi.org/10.1016/j.fss.2018.05.007openalex-snapshot
Bilattice logic properly displayed
inferred← citeshttps://doi.org/10.1016/j.jlamp.2016.10.006openalex-snapshot
Algebraic modal correspondence: Sahlqvist and beyond
inferred← citeshttps://doi.org/10.1093/jigpal/jzab029openalex-snapshot
Algorithmic correspondence for hybrid logic with binder
inferred← citeshttps://doi.org/10.1093/jigpal/jzw063openalex-snapshot
23rd Workshop on Logic, Language, Information and Computation (WoLLIC 2016)
inferred← citeshttps://doi.org/10.1093/jigpal/jzy039openalex-snapshot
Analogues of Bull’s theorem for hybrid logic
inferred← citeshttps://doi.org/10.1093/logcom/exab004openalex-snapshot
Algorithmic correspondence and canonicity for possibility semantics
inferred← citeshttps://doi.org/10.1093/logcom/exv041openalex-snapshot
Jónsson-style canonicity for ALBA-inequalities
inferred← citeshttps://doi.org/10.1093/logcom/exw011openalex-snapshot
Dual characterizations for finite lattices via correspondence theory for monotone modal logic
inferred← citeshttps://doi.org/10.1093/logcom/exw012openalex-snapshot
Unified correspondence and proof theory for strict implication
inferred← citeshttps://doi.org/10.1093/logcom/exw014openalex-snapshot
Sahlqvist theory for impossible worlds
inferred← citeshttps://doi.org/10.1093/logcom/exw022openalex-snapshot
Unified correspondence as a proof-theoretic tool
inferred← citeshttps://doi.org/10.1145/3570919openalex-snapshot
Linear Logic Properly Displayed
inferred← citeshttps://doi.org/10.13140/rg.2.1.2560.4082openalex-snapshot
Correspondence and Canonicity in Non-Classical Logic
inferred← citeshttps://doi.org/10.23638/lmcs-15(1:15)2019openalex-snapshot
Sahlqvist via Translation
inferred← citeshttps://doi.org/10.23638/lmcs-15(1:27)2019openalex-snapshot
Stone-Type Dualities for Separation Logics
inferred← citeshttps://doi.org/10.23638/lmcs-16(3:8)2020openalex-snapshot
Constructive Canonicity of Inductive Inequalities
inferred← citeshttps://doi.org/10.48550/arxiv.1511.04271openalex-snapshot
Canonicity and Relativized Canonicity via Pseudo-Correspondence: an Application of ALBA
inferred← citeshttps://doi.org/10.48550/arxiv.1603.06547openalex-snapshot
Constructive canonicity for lattice-based fixed point logics
inferred← citeshttps://doi.org/10.48550/arxiv.1603.08204openalex-snapshot
Unified Correspondence as a Proof-Theoretic Tool
inferred← citeshttps://doi.org/10.48550/arxiv.2003.08070openalex-snapshot
Sahlqvist Correspondence Theory for Sabotage Modal Logic
inferred← citeshttps://doi.org/10.48550/arxiv.2102.13291openalex-snapshot
Algorithmic Correspondence for Hybrid Logic with Binder
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.