Talks and Poster Presentations (without Proceedings-Entry):
Keynote Lecture: Proof Theory in Logic workshop,
Interpolation is one of fundamental desired properties of a logic. The ability to construct interpolants is often listed as an expected benefit of treating a logic by methods of structural proof theory, alongside proving decidabilty. While proof theory has long expanded from simple sequent systems to more complex data structures allowing to capture more and more logics, the applications of these data structures to interpolation lagged behind. We present an overview of how constructive interpolation proofs can be achieved via hypersequents, nested sequents, labelled sequents, and other intermediate formalisms.
Created from the Publication Database of the Vienna University of Technology.