Courses for 2005-2006, fall semester
required
- Λ1. Mathematical logic (Dimitracopoulos)
- Λ2. Computability (Moschovakis)
- Λ3. Algorithms and complexity I (Koutsoupias)
elective required
- Π6. Databases (Afrati, Vassalos)
elective (mathematical logic)
- M11. Recursion theory (Moschovakis)
elective (logic)
- Λ15. Proof theory (Koletsos, Stavrinos)
Special Topics in Logic
- Λ03Α. Computational algebraic geometry (Raptis)
- Λ98Γ. Category theory and applications (Karazeris, Rigas)
- Λ99Α. Finite model theory (Richerby)
special topics in computer science
- Π00Γ. Combinatorial optimization (Zissimopoulos)
- Π02Γ. Cryptography and complexity (Zachos)
- Π02Δ. Computational geometry (Emiris)
- Π03Γ. Type systems for programming languages (Papaspyrou)
special topics in mathematics
- Μ05Ν. Constructive arithmetic and analysis (Moschovakis)