Courses for 2003-2004, fall semester
required
- Λ2. Computability (Moschovakis)
- Λ3. Algorithms and complexity I (Koutsoupias)
elective required
- Μ6. Set theory (Moschovakis)
elective (logic)
- Λ14. Introduction to λ-calculus (Stavrinos)
Special Topics in Logic
- Λ00Γ. Combinatorial complexity (Zissimopoulos)
- Λ03Α. Computational algebraic geometry (Raptis)
- Λ03Ν. Models of peano arithmetic (Dimitracopoulos)
special topics in computer science
- Π03Ε. Network algorithms and complexity (Pagourtzis)
- Π03Ξ. Approximation algorithms (Afrati, Aslanidis)