Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4951372 | Journal of Logical and Algebraic Methods in Programming | 2017 | 22 Pages |
Abstract
We prove strong completeness of a range of substructural logics with respect to a natural poset-based relational semantics using a coalgebraic version of completeness-via-canonicity. 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. Moreover, we believe that the coalgebraic framework provides a systematic and principled way to study the relationship between resource models on the semantics side, and substructural logics on the syntactic side.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Fredrik Dahlqvist, David Pym,