Uniform Lyndon Interpolation for Basic Non-normal Modal and Conditional Logics
Amirhossein Akbar Tabatabai, Rosalie Iemhoff, Raheleh Jalali

TL;DR
This paper introduces a proof-theoretic method to establish uniform Lyndon interpolation for various non-normal modal and conditional logics, providing new constructive proofs and explicit interpolant computations, and clarifies which logics possess this property.
Contribution
It presents a novel proof-theoretic approach to prove uniform Lyndon interpolation for multiple non-normal modal and conditional logics, including explicit construction of interpolants.
Findings
Several logics have uniform Lyndon interpolation, including $ extsf{E}$, $ extsf{M}$, $ extsf{EN}$, and others.
Some logics like $ extsf{CKCEM}$ and $ extsf{CKCEMID}$ have uniform interpolation but not Lyndon.
Certain non-normal modal logics do not have Craig or uniform (Lyndon) interpolation.
Abstract
In this paper, a proof-theoretic method to prove uniform Lyndon interpolation for non-normal modal and conditional logics is introduced and applied to show that the logics , , , , , , and their conditional versions, , , , , , , in addition to have that property. In particular, it implies that these logics have uniform interpolation. Although for some of them the latter is known, the fact that they have uniform Lyndon interpolation is new. Also, the proof-theoretic proofs of these facts are new, as well as the constructive way to explicitly compute the interpolants that they provide. On the negative side, it is shown that the logics and enjoy uniform interpolation but not uniform…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Logic, programming, and type systems · Logic, Reasoning, and Knowledge
