Courses for 2013-2014
required
- Λ1. Mathematical logic (Kirousis)
elective required
- Μ6. Set theory (Tsarpalias)
elective (logic)
- Λ14. Introduction to λ-calculus (Koletsos)
elective (computer science logic)
- Π17. Mathematics and cryptography (Raptis)
Special Topics in Logic
- Π09Γ. Advanced topics in algorithms and complexity (Pagourtzis, Zachos)
special topics in computer science
- Π02Δ. Computational geometry (Emiris)
- Π03Β. Semantics of programming languages (Rondogiannis)
- Π03Ε. Network algorithms and complexity (Pagourtzis)
- Π03Ζ. Algorithms in structural bioinformatics (Chrysina, Emiris)
- Π03Ξ. Approximation algorithms (Kolliopoulos)
- Π05Β. Computation models and complexity (Zachos)
half-course
required
- Λ2. Computability (Arvanitakis)
- Λ3. Algorithms and complexity I (Fotakis, Zachos)
- Λ4. Algorithms and complexity II (Pagourtzis, Zachos)
elective (mathematical logic)
- M12. Model theory (Dimitracopoulos)
elective (logic)
- Λ13Α. Applied Proof Theory (Koletsos, Rigas)
- Λ13Β. Formal Methods and Software (Stephaneas)
special topics in computer science
- Π00Γ. Combinatorial optimization (Zissimopoulos)
- Π02Γ. Cryptography and complexity ()
- Π02Ε. Computational algebra (Emiris)
- Π03Γ. Type systems for programming languages (Papaspyrou)
- Π10Α. Knowledge technologies (Koubarakis)
- Π98Π. Cryptography (Kiayias)