Courses for 2001-2002
required
- Λ4. Algorithms and complexity II (Andronikos)
elective required
- Μ6. Set theory (Arvanitakis)
elective (mathematical logic)
- M12. Model theory (Cornaros, Dimitracopoulos)
elective (logic)
- Λ14. Introduction to λ-calculus (Koletsos, Stavrinos)
elective (computer science logic)
- Π17. Mathematics and cryptography (Raptis)
Special Topics in Logic
- Λ99Ε. Topics in databases (Karali, Nikolaidou)
special topics in computer science
- Π00Γ. Combinatorial optimization (Zissimopoulos)
- Π01Γ. Parallel algorithms and complexity (Zachos)
- Π01Π. Algorithms for data mining (Afrati)
- Π99Π. Data networks (Kranakis)
required
- Λ1. Mathematical logic (Dimitracopoulos)
- Λ2. Computability (Moschovakis)
- Λ3. Algorithms and complexity I (Andronikos)
elective (logic)
- Λ16. Non-classical logics (Koutras)
Special Topics in Logic
- Λ01Ν. Introduction to recursion in higher types (Moschovakis)
- Λ01Ξ. Mathematics and robotics (Raptis)
- Λ97Α. Probabilistic algorithms (Koutsoupias)
- Λ98Ν. Metamathematics of set theory (Arvanitakis)
special topics in computer science
- Π01Α. Online algorithms (Koutsoupias)