The logic group provides a substantial number of courses in logic and theoretical computer science on both the undergraduate and graduate levels. The research effort of the group falls to a large part within the area common to mathematics and theoretical computer science and is primarily concerned with computability theory, constructive mathematics, type theory, domain theory and proof theory. Future work will include approximation theory using domains and formal spaces and complexity of computations over general algebras.
Proof theory is fundamental for much of computing.
A constructive logic has the important advantage that an algorithm, often a program, can be directly extracted from a proof in the system. Model theory is complementary to Proof theory and is increasingly finding applications in computer science. This has semantical applications to constraint programming languages and to hardware.