Mobile menu icon
Skip to navigation | Skip to main content | Skip to footer
Mobile menu icon Search iconSearch
Search type

Department of Computer Science


Categorical proof theory

Primary supervisor

Additional information

Contact admissions office

Other projects with the same supervisor

Funding

  • Competition Funded Project (Students Worldwide)

This research project is one of a number of projects at this institution. It is in competition for funding with one or more of these projects. Usually the project which receives the best applicant will be awarded the funding. Applications for this project are welcome from suitably qualified candidates worldwide. Funding may only be available to a limited set of nationalities and you should read the full department and project details for further information.

Project description

There is a strong connection between programs and the proofs for certain logics. By finding mathematical models for either of these we increase our understanding of them. Because logical connectives relate closely to constructions in the model it is often mathematically cleaner to consider the former. (Categorical) proof theory is concerned with how proofs may be modelled, and which proofs can be considered equivalent to each other. While there are some logics whose proof theory is well understood these are fairly limited. The aim of this project is to extend what is known to more interesting logics.

As described above there are several projects that might fit under this description, and precise details are to be agreed between a successful applicant and the supervisor.

One possibility would be the following: We have a number of models that function well in the context of multiplicative linear logic, in the sense that every morphism in the model is the denotation of a derivation and and that there is an independently defined equivalence relation of those derivations which are interpreted by the same morphism in the model, but extending this result to the additive connectives has proved hard (there is only one published proof and that does not apply to the generally accepted notion of equivalence of proofs). A possible PhD project in this space could aim to look at this question, building on a new description of the model for the multiplicative fragment.

Other possibilities would be to look at theories of derivations that arise from `deep inference' systems, or the question of how we might use higher categorical structure to model more fine-grained connections between derivations than equivalence relations.

Person specification

For information

Essential

Applicants will be required to evidence the following skills and qualifications.

  • This project requires mathematical engagement and ability substantially greater than for a typical Computer Science PhD. Give evidence for appropriate competence, as relevant to the project description.
  • You must be capable of performing at a very high level.
  • You must have a self-driven interest in uncovering and solving unknown problems and be able to work hard and creatively without constant supervision.

Desirable

Applicants will be required to evidence the following skills and qualifications.

  • You will have good time management.
  • You will possess determination (which is often more important than qualifications) although you'll need a good amount of both.

General

Applicants will be required to address the following.

  • Comment on your transcript/predicted degree marks, outlining both strong and weak points.
  • Discuss your final year Undergraduate project work - and if appropriate your MSc project work.
  • How well does your previous study prepare you for undertaking Postgraduate Research?
  • Why do you believe you are suitable for doing Postgraduate Research?