| Notes |
Date |
| First-Order Logic: Syntax, Semantics
and Models |
February 3 |
| First-Order Logic: Axioms, Proofs and
Theoremhood |
February 3 |
| First-Order Logic: Completness,
Compactness and Inexpressibility |
February 5 |
| Second-Order Logic |
February 5 |
| Undecidability in Logic - Part I |
February 12 |
| Undecidability in Logic - Part II |
February 17 |
| Relations between complexity classes -
General Techniques |
February 19 |
| Relations between complexity classes - The Reachability Method |
February 20 |
| Reductions and Completness |
February 24 |
| The class NP |
March 3 |
| NP-completeness proofs |
March 5 |
| The class coNP |
March 10 |
| The classes FNP and TFNP |
March 12 |
| Randomized complexity classes |
March 26 |
| Circuit complexity |
March 30 |
| Primality in coRP |
May 1 |
| Approximability |
May 1 |
| Parallel Computation |
May 1 |
| Logarithmic space |
May 1 |
| The Polynomial Hierarchy and PSPACE |
May 1 |
| Complexity of Counting |
May 1 |
| Cryptography |
May 1 |