In Structural Proof Theory we are interested not only in the semantics of proofs and the processes of cut elimination and normalisation, but in the dynamics of proof-search. This is one of the fundamental enabling technologies of computer science, and one which is sadly underdeveloped. The theoreticians benefit from close contact with people interested in more practical problems, such as the rigorous design of programs, or their formal verification. More recently we have extended our range to include the verification of critical systems, and the use of formal methods in dependable programming. Most of the other groups in the department are also sympathetic to formal approaches, and we are keen to foster cross-group collaboration.
Some links already exist with each of the other groups.
The group are happy to be approached about PhD Research Opportunities on any of the areas of described research.