Professor
Computer Science
Telephone: (01792) 602370
Email: JavaScript is required to view this email address.
Room: Office - 402
Fourth Floor
Computational Foundry
Bay Campus

Areas of Expertise

  • Mathematical Logic
  • Theoretical Computer Science
  • Proof theory and proof complexity
  • Bounded arithmetic and propositional proof complexity
  • Implicit computational complexity
  • Reduction systems
  • Intermediate predicate logics

Publications

  1. & Feasible set functions have small circuits. Computability, 1-32.
  2. & Hyper Natural Deduction for Gödel Logic—A natural deduction system for parallel reasoning. Journal of Logic and Computation 28(6), 1125-1187.
  3. & Total Search Problems in Bounded Arithmetic and Improved Witnessing. In Logic, Language, Information, and Computation. (pp. 31-47). Springer.
  4. & The NP Search Problems of Frege and Extended Frege Proofs. ACM Transactions on Computational Logic 18(2), 1-19.
  5. & Cobham Recursive Set Functions and Weak Set Theories. In Sets and Computations. (pp. 55-116). World Scientific.

See more...

Teaching

  • CSCM29 Blockchain, Cryptocurrencies and Smart Contracts

    This is a module on modern blockchain technology and its major applications. It will give an overview on the technological setup of major cryptocurrencies, and introduce the blockchain as a concept for determining the order of events in a distributed database. In addition, it will discuss the implementation of smart contracts and summarise the current state of the art of security issues in cryptocurrencies, the blockchain, and smart contracts.

Supervision

  • The combinatorics of minimal unsatisfiability (current)

    Student name:
    PhD
    Other supervisor: Dr Oliver Kullmann
  • Untitled (current)

    Student name:
    PhD
    Other supervisor: Dr Anton Setzer