Welcome. Finite Model Theory studies logic when the model is restricted to be finite. Applications of finite model theory include verification, databases, and programming languages. The topics covered range from classical to more recent results, such as: 0/1 laws, theory of conjunctive queries, descriptive complexity (connection between the logic language and complexity classes), pebble games, the AGM bound, deriving algorithms from information inequalities.
Instructor: Dan Suciu
Lectures: Monday, Wednesday 10-11:20 in CSE2 371
Calendar here. Please subscribe.
Lecture list: here.
Canvas: here.
Ed discussion board: here
Homework list here. Please submit on canvas I strongly recommend using Latex to write your answers. I prepared a simple template here; you may use it, or use your own preferred Latex style.
Zoom link: on canvas.
Grading (updated):
By default, the course is Credit/No-credit.
If you need a numerical grade, send me an email. In that case I will ask you to submit all the homework assignments Notice that, if you want to use the course for CSE++ PhD course requirements or any BSMS course requirements you need to take the course for a numerical grade. A CR/NC will not count towards the course requirements, instead it will function more like a 590/591.