This is a static snapshot of the website of MPLA, taken on 2025-02-27.

You are here: Courses » 1999-2000

Navigator

Fortune cookie

“Your discovery of the contradiction caused me the greatest surprise and, I would almost say, consternation, since it has shaken the basis on which I intended to build my arithmetic.... It is all the more serious since, with the loss of my rule V, not only the foundations of my arithmetic, but also the sole possible foundations of arithmetic seem to vanish.”

Gottlob Frege.

Courses for 1999-2000

fall semester spring semester

required

Λ4. Algorithms and complexity II (Dimitriou)

elective required

Μ6. Set theory (Tsarpalias)

elective (logic)

Λ14. Introduction to λ-calculus (Koletsos)

elective (computer science logic)

Π19. Mathematical theory of programming languages ()

Special Topics in Logic

Λ99Ν. Topics in set theory (Moschovakis)

special topics in computer science

Π99Π. Data networks (Kranakis)

required

Λ1. Mathematical logic (Dimitracopoulos)
Λ2. Computability (Moschovakis)
Λ3. Algorithms and complexity I (Dimitriou)

Special Topics in Logic

Λ99Α. Finite model theory (Weinstein)
Λ99Β. Automata and applications (Soskov)
Λ99Γ. Modal logic (Koutras)

special topics in mathematics

Μ99Δ. Descriptive set theory (Moschovakis)

Reporter

Posts

Web standards: XHTML1.0, CSS3.

Powered by: OpenBSD, vim, nginx, Haskell, Ruby, Python, PostgreSQL, SQLite, django, schole.

© 1996 – 2018 MPLA: Graduate program in Logic, Algorithms and Computation.
Contact the webmaster.