Abstract
Interpolation is a fundamental logical property with applications in mathematics, computer science, and artificial intelligence. In this paper, we develop a general method of translating a semantic description of modal logics via Kripke models into a constructive proof of the Lyndon interpolation property (LIP) via labelled sequents. Using this method we demonstrate that all frame conditions representable as Horn formulas imply the LIP and that all 15 logics of the modal cube, as well as the infinite family of transitive Geach logics, enjoy the LIP.
Author supplied keywords
Cite
CITATION STYLE
Kuznets, R. (2016). Proving craig and lyndon interpolation using labelled sequent calculi. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10021 LNAI, pp. 320–335). Springer Verlag. https://doi.org/10.1007/978-3-319-48758-8_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
