2000 character limit reached
Coalgebraic completeness-via-canonicity for distributive substructural logics
Published 20 Aug 2015 in cs.LO | (1508.04940v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.