On the public citation graph
Canonicity results for mu-calculi: an algorithmic approach
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.
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.1006/inco.1999.2836openalex-snapshot
Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus
inferredcites →https://doi.org/10.1007/978-94-009-8937-5_5openalex-snapshot
Semantics for a Class of Intuitionistic Modal Calculi
inferredcites →https://doi.org/10.1007/978-94-017-2109-7_17openalex-snapshot
Intuitionistic Modal Logic
inferredcites →https://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
inferredcites →https://doi.org/10.1007/s11225-012-9388-9openalex-snapshot
Sahlqvist Correspondence for Modal mu-calculus
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(95)00045-xopenalex-snapshot
Duality and the completeness of the modal μ-calculus
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.tcs.2011.11.026openalex-snapshot
Sahlqvist theorem for modal fixed point logic
inferredcites →https://doi.org/10.1016/j.tcs.2014.10.027openalex-snapshot
Algorithmic correspondence for intuitionistic modal mu-calculus
inferredcites →https://doi.org/10.2178/jsl/1122038910openalex-snapshot
Minimal predicates, fixed-points, and definability
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-032-22626-6_2openalex-snapshot
Hybrid Logics with Moving Names
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.1007/s10992-025-09820-8openalex-snapshot
Inductive Sequents for Distributive Modal Logic
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.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.1017/s175502031700034xopenalex-snapshot
THE LOGIC OF RESOURCES AND CAPABILITIES
inferred← citeshttps://doi.org/10.1093/jigpal/jzab032openalex-snapshot
Jónsson-style canonicity in distributive modal µ-calculus
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/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.13140/rg.2.1.2560.4082openalex-snapshot
Correspondence and Canonicity in Non-Classical Logic
inferred← citeshttps://doi.org/10.23638/lmcs-16(3:8)2020openalex-snapshot
Constructive Canonicity of Inductive Inequalities
inferred← citeshttps://doi.org/10.3390/logics3030010openalex-snapshot
Distribution-Free Modal Logics: Sahlqvist–Van Benthem Correspondence
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
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.