Completeness via Canonicity for Distributive Substructural Logics: A Coalgebraic Perspective

We prove strong completeness of a range of substructural logics with respect to their relational semantics by completeness-viacanonicity. Specifically, we use the topological theory of canonical (in) equations in distributive lattice expansions to show that distributive substructural logics are strongly complete with respect to their relational semantics. By formalizing the problem in the language of coalgebraic logics, we develop a modular theory which covers a wide variety of different logics under a single framework, and lends itself to further extensions.

• Type: Journal
• Year: 2015
• Where: RELMICS
• Authors: Fredrik Dahlqvist, David J. Pym
• Keywords: RELMICS 2015, Theoretical Computer Science