Coalgebraic Dynamic Logics

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

• Clemens Kupke (University of Strathclyde)
• Friday 24 March 2017, 11:00-12:00
• Computer Science Sloman Lounge.

If you have a question about this talk, please contact Paul Taylor.

I will present a (co)algebraic framework for dynamic modal logics such as Propositional Dynamic Logic (PDL) and Game Logic (GL). Program/game constructs of these logics arise from monad structure, and the axioms of these logics express compatibility requirements between the modal operators and the monad structure. This observation leads to a generic soundness and completeness result for PDL -like logics for T-coalgebras where T is a monad and the program constructs are given by sequential composition, test, and point-wise extensions of operations of T.

(Joint work with Helle Hvid Hansen.)

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 Sloman Lounge
• Theoretical computer science seminar
• computer sience

Note that ex-directory lists are not shown.