[Proof Complexity] Postdoc in Proof Theory - University of Birmingham, UK

anupamdotdas at gmail.com anupamdotdas at gmail.com
Thu May 28 17:21:27 CEST 2020

Research Fellow in Proof Theory - School of Computer Science, University of
Birmingham, UK.

The School of Computer Science at the University of Birmingham is seeking to
appoint up to 2 Research Fellows (postdocs) in Proof Theory, for a duration
of 2 years (with possibility of extension). The theory group at the
University of Birmingham is one of the leading groups in logical foundations
of computer science, with expertise not only in Proof Theory but also
related areas such as Type Theory, Category Theory and Mathematical Logic:


These positions are funded by a UKRI Future Leaders Fellowship “StrIP:
Structure vs Invariants in Proofs”, led by Dr Anupam Das. The project aims
to develop the theory of ‘cyclic proofs’ and their connections to automata
theory. The principal responsibility of the fellow(s) will be to conduct
research, both collaboratively with Dr Das and other researchers at
Birmingham, and independently. The fellow(s) will also be supported in
career development and encouraged to pursue independent opportunities.

Qualifications and expertise

You will have (or be close to completing) a PhD in Logic (computer science,
mathematics or philosophy), or equivalent qualifications. You will have an
excellent research record, with expertise in some of the following areas:

* Proof theory (in particular, deep inference or cyclic proofs).
* Automata theory (in particular, infinite word and tree automata).
* Mathematical logic (in particular, fragments of arithmetic or set theory).


Informal inquiries prior to application are encouraged and should be
directed to Dr Anupam Das <a.das at bham.ac.uk>. You may find further details
on the positions and instructions for applying here:


Practical information

Starting salary range: £30,942 - £40,322 (potentially progressing to
Application deadline: 24 June 2020.
Starting date: As soon as possible, but ideally no later than October 2020.
Duration: 2 years (with possibility of extension)

More information about the Proof-Complexity mailing list