There is a long tradition in theoretical computer science connecting logic and automata theory. As a paradigmatic example we mention the link between the modal mu-calculus and parity automata on graphs. Much of this work has a strong coalgebraic flavour, but to our knowledge this perspective has never been made …

read more# Other presentations

# Automata and Fixed Point Logics for Coalgebras

There is a long tradition in theoretical computer science connecting logic and automata theory. As a paradigmatic example we mention the link between the modal mu-calculus and parity automata on graphs. Much of this work has a strong coalgebraic flavour, but to our knowledge this perspective has never been made …

read more# Unifying the field of modal logics

Nowadays there is an enormous and at times bewildering variety of modal and other non-classical logics. Nevertheless, it still makes sense to speak of `modal logic' as such since there is a well-developed mathematical theory which emphasizes the unity of the field. This theory is supported by a number of …

read more

Page 1 / 1