Analyzing Logics Using Automata
Logic and Computation (Introductory)
First week, from 11:00 to 12:30
In this course, we follow the development of this idea from work in modal logic that is several decades old, to more recent examples representing some of the most expressive decidable logics. We describe how finite automata are the key to reasoning about logics on restricted structures like trees, and how unravellings and simulations are the key to transferring these results to general structures.