Distribution-Free Modal Logics: Sahlqvist -- Van Benthem Correspondence
By: Chrysafis, Hartonas
Potential Business Impact:
Makes logic puzzles work with fewer rules.
We present an extension and generalization of Sahlqvist--Van Benthem correspondence to the case of distribution-free modal logic, with, or without negation and/or implication connectives. We follow a reductionist strategy, reducing the correspondence problem at hand to the same problem, but for a suitable system of sorted modal logic (the modal companion of the distribution-free system). The reduction, via a fully abstract translation, builds on duality between normal lattice expansions and sorted residuated frames with relations (a generalization of classical Kripke frames with relations). The approach is scalable and it can be generalized to other systems, with or without distribution, such as distributive modal logic, or substructural logics with, or without additional modal operators.
Similar Papers
A General (Uniform) Relational Semantics for Sentential Logics
Logic in Computer Science
Makes many different logic systems work the same.
First-Order Modal Logic via Logical Categories
Logic in Computer Science
Makes computers understand logic better.
Paraconsistent Constructive Modal Logic
Logic in Computer Science
Helps computers think about things that are both true and false.