Nested proof systems for modal logics (and beyond)

Add to your list(s) Download to your calendar using vCal

• Sonia Marin, UCL
• Friday 25 October 2019, 11:00-12:00
• Computer Science, The Sloman Lounge (UG).

If you have a question about this talk, please contact Anupam Das.

Nested sequents are a generalization of ordinary sequents to tree-like instead of list-like structures. They have been designed specifically to provide sound and complete deductive systems for modal logics between K and S5, but they have since then proved useful for various other logics that could also not be handled in ordinary Gentzen calculi. In this talk, I will present the formalism of nested sequents and some applications. If time permit, I will review one of our contributions, that is, how to apply the focusing technique to some of the nested sequent calculi, bringing forward fine synthetic normal forms for modal proofs.

This talk is part of the Theoretical computer science seminar series.

This talk is included in these lists:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Computer Science, The Sloman Lounge (UG)
• Theoretical computer science seminar
• computer sience

Note that ex-directory lists are not shown.