Courses for 2004-2005, fall semester
required
- Λ2. Computability (Moschovakis)
- Λ3. Algorithms and complexity I (Koutsoupias)
elective required
- Μ6. Set theory (Moschovakis)
- Π6. Databases (Afrati)
elective (mathematical logic)
- M12. Model theory (Dimitracopoulos)
Special Topics in Logic
- Λ02Α. Arithmetic complexity (Moschovakis)
- Λ03Α. Computational algebraic geometry (Raptis)
- Λ04Α. Proofs and programs (Koletsos, Stavrinos)
special topics in computer science
- Π00Γ. Combinatorial optimization (Zissimopoulos)
- Π03Γ. Type systems for programming languages (Papaspyrou)