Abstract Measures of Low-Level Computational Complexity
Dr Arnold Beckmann)
is funded by the EPSRC.
The general Aims and Objectives of the Project are:
The overall aim
is to obtain a deep and thorough understanding of
the abstract complexity inherent in bounded arithmetic theories
and propositional proof systems. [...]
The project is now finished.
Further information of its outcomes will be published soon.