[Back]


Talks and Poster Presentations (with Proceedings-Entry):

R. Kuznets:
"Proving Craig and Lyndon Interpolation Using Labelled Sequent Calculi";
Talk: 15th European Conference On Logics In Artificial Intelligence (JELIA 2016), Larnaka, Zypern; 2016-11-09 - 2016-11-11; in: "Logics in Artificial Intelligence, 15th European Conference, JELIA 2016, Larnaca, Cyprus, November 9-11, 2016, Proceedings", L. Michael, A. Kakas (ed.); Springer LNCS, 10021 (2016), ISBN: 978-3-319-48757-1; 320 - 335.



English 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.

Keywords:
Craig interpolation, Lyndon interpolation, Labelled sequents, Modal logic, Geach formulas


"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/978-3-319-48758-8_21

Electronic version of the publication:
http://publik.tuwien.ac.at/files/publik_256036.pdf


Created from the Publication Database of the Vienna University of Technology.