Courses for 2000-2001
required
- Λ4. Algorithms and complexity II (Dimitriou)
elective required
- Μ6. Set theory (Tsarpalias)
elective (computer science logic)
- Π17. Mathematics and cryptography (Raptis)
Special Topics in Logic
- Λ99Ε. Databases (Ioannidis, Karali)
special topics in computer science
- Π00Γ. Combinatorial optimization (Koutsoupias, Zissimopoulos)
- Π00Δ. Approximation algorithms and computational geometry (Zachos)
required
- Λ1. Mathematical logic (Dimitracopoulos)
- Λ2. Computability (Moschovakis)
- Λ3. Algorithms and complexity I (Dimitriou)
elective (computer science logic)
- Π18. Logic programming (Foustoucos)
Special Topics in Logic
- Λ98Β. Introduction to Constructive Mathematics (Moschovakis)
- Λ98Ν. Metamathematics of set theory (Moschovakis)