Tin Perkov

Logic & Computation

Week Two - 17.00-18.30 - Level: A

Room: N2

Abstract:

This course presents model-theoretic methods for reasoning about the expressive power of modal languages. We consider Kripke model semantics on local and global level, as well as Kripke frame semantics. Techniques of bisimulation games, modal saturation and automatic correspondence will be used to prove important results like Van Benthem Characterization Theorem, Goldblatt-Thomason Theorem and Sahlqvist Correspondence Theorem. These methods involve bisimulations, basic model constructions like generated submodels and disjoint unions, and advanced constructions like ultraproducts and ultrafilter extensions.