Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Uniform Lyndon Interpolation for Basic Non-normal Modal and Conditional Logics (2208.05202v1)

Published 10 Aug 2022 in math.LO and cs.LO

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 $\mathsf{E}$, $\mathsf{M}$, $\mathsf{EN}$, $\mathsf{MN}$, $\mathsf{MC}$, $\mathsf{K}$, and their conditional versions, $\mathsf{CE}$, $\mathsf{CM}$, $\mathsf{CEN}$, $\mathsf{CMN}$, $\mathsf{CMC}$, $\mathsf{CK}$, in addition to $\mathsf{CKID}$ 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 $\mathsf{CKCEM}$ and $\mathsf{CKCEMID}$ enjoy uniform interpolation but not uniform Lyndon interpolation. Moreover, it is proved that the non-normal modal logics $\mathsf{EC}$ and $\mathsf{ECN}$ and their conditional versions, $\mathsf{CEC}$ and $\mathsf{CECN}$, do not have Craig interpolation, and whence no uniform (Lyndon) interpolation.

Citations (4)

Summary

We haven't generated a summary for this paper yet.