Computation with Bounded Resources
Research Group

Associated Projects

Proof theory for branching quantifiers: CERES and beyond

Satisfiability Checking and Symbolic Computation (SC^2-CSA)

Completed Projects

The Fine Structure of Formal Proof Systems and their Computational Interpretations (FISP)

Complexity Analysis-based Guaranteed Execution (CAGE)

Automated Complexity Analysis via Transformations (ACAT)

Structural and Computational Proof Theory

Logic-Based Analysis of Computation

Derivational Complexity Analysis