Seminar Mathematical Logic

**[General Information] **
**[Schedule] **
**[Audience/Material] **
**[Evaluation] **

## General Information
This general information (as well as the rest of the website) will be updated as more information becomes available. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||

## Schedule:Changes to the original schedule (such as cancelled class or class moved to another day/time/place) will be made in red
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||

## Intended Audience and Material:This course is intended for M.Sc. students of Logic who have an interest in specializing in mathematical logic. The topics in the seminar will roughly focus on automata, infinite games, and how these relate to logic. Most of the papers to present will come from the volume Automata, Logics, and Infinite Games, LNCS 2500, 2002. doi:10.1007/3-540-36387-4Other suggested reading: - A textbook: Bakhadyr Khoussainov and Anil Nerode.
*Automata Theory and its Applications*. Birkhauser, 2001. ISBN: 0-8176-4207-2. - A handbook chapter: W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume III, pages 389–455. Springer, New York, 1997.
- Application to theoretical computer science: (Chapter 4 of) C. Baier and J. Katoen.
*Principles of Model Checking*. MIT Press, Cambridge, 2008. ISBN: 978-0-262-02649-9 - Probabilistic automata: M. Rabin. Probabilistic Automata.
*Information and Control*, Volume 6, Issue 3, September 1963, pages 230–245. - Quantum automata: (Section 3 of) M. Ying. Quantum Logic and Automata Theory. In Handbook of Quantum Logic and Quantum Structures, Quantum Structures, 2007, pages 619–754.
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||

## Evaluation:The course is graded on a pass/fail basis. In order to pass, a student will have to give a (typically 45–60 minute-long, but optionally up to 2 hour-long) presentation in class. Attendence/participation is also required. |