Uniform Lyndon interpolation property in propositional modal logics

2018/09/04 by Taishi Kurahashi, Kurahashi, Taishi
Computer Science · #FOS: Mathematics #Logic (math.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Multi-Agent Systems and Negotiation

paper · pdf · doi:10.48550/arxiv.1809.00943

openalex publication_date 2018/09/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We introduce and investigate the notion of uniform Lyndon interpolation property (ULIP) which is a strengthening of both uniform interpolation property and Lyndon interpolation property. We prove several propositional modal logics including \bf K, \bf KB, \bf GL and \bf Grz enjoy ULIP. Our proofs are modifications of Visser's proofs of uniform interpolation property using layered bisimulations. Also we give a new upper bound on the complexity of uniform interpolants for \bf GL and \bf Grz.

Related

• Lyndon interpolation property for extensions of S4 and intermediate propositional logics
• Uniform Lyndon interpolation for intuitionistic monotone modal logic
• Uniform Lyndon interpolation for the pure logic of necessitation with a modal reduction principle
• Uniform Lyndon Interpolation for Basic Non-normal Modal and Conditional Logics
• A proof-theoretic approach to uniform interpolation property of multi-agent modal logic