1 May 2018, ILLC Seminar, Bahareh Afshari

Modal logic provides an effective language for expressing
properties of state-based systems. When equipped with operators
that can test for infinite behaviour like looping and
reachability, the logic becomes a powerful tool for specifying
correctness of nonterminating, reactive processes such as
communication protocols and control systems. An elegant example
of such a logic is the modal mu-calculus which extends basic
modal logic by two quantifiers for defining inductive and
co-inductive operators. As well as being highly expressive, this
logic enjoys good computational properties (decidability, finite
model property, …) that distinguish it as a central logic in
computer science. In this talk I will introduce the modal
mu-calculus, present some key properties and discuss recent
results regarding its proof theory.