Courses for 2004-2005
required
- Λ1. Mathematical logic (Dimitracopoulos)
- Λ4. Algorithms and complexity II (Potika)
elective (logic)
- Λ14. Introduction to λ-calculus (Koletsos, Stavrinos)
elective (computer science logic)
- Π17. Mathematics and cryptography (Raptis)
special topics in computer science
- Π00Δ. Approximation algorithms and computational geometry (Zachos)
- Π02Ζ. Topics in game theory and computation (Koutsoupias)
- Π03Β. Semantics of programming languages (Rondogiannis)
- Π03Δ. Geometric and Algebraic Algorithms in Molecular Biology (Emiris)
- Π03Ε. Network algorithms and complexity (Pagourtzis)
- Π03Ν. Logic in artificial intelligence (Peppas)
- Π99Π. Data networks (Kranakis)
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)