eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2017-11-17
21:1
21:16
10.4230/LIPIcs.CALCO.2017.21
article
Uniform Interpolation in Coalgebraic Modal Logic
Seifan, Fatemeh
Schröder, Lutz
Pattinson, Dirk
A logic has uniform interpolation if its formulas can be projected down to given subsignatures, preserving all logical consequences that do not mention the removed symbols; the weaker property of (Craig) interpolation allows the projected formula - the interpolant - to be different for each logical consequence of the original formula. These properties are of importance, e.g., in the modularization of logical theories. We study interpolation in the context of coalgebraic modal logics, i.e. modal logics axiomatized in rank 1, restricting for clarity to the case with finitely many modalities. Examples of such logics include the modal logics K and KD, neighbourhood logic and its monotone variant, finite-monoid-weighted logics, and coalition logic. We introduce a notion of one-step (uniform) interpolation, which refers only to a restricted logic without nesting of modalities, and show that a coalgebraic modal logic has uniform interpolation if it has one-step interpolation. Moreover, we identify preservation of finite surjective weak pullbacks as a sufficient, and in the monotone case necessary, condition for one-step interpolation. We thus prove or reprove uniform interpolation for most of the examples listed above.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol072-calco2017/LIPIcs.CALCO.2017.21/LIPIcs.CALCO.2017.21.pdf
modal logic
coalgebraic logic
uniform interpolation
preservation of weak pullbacks