Articles and notes – Anupam Das

Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)

A recursion-theoretic characterisation of the positive polynomial-time functions

Preprint

Focussing, MALL and the polynomial hierarchy

Preprint.

Alternating time bounds from variants of focussed proof systems

Characterising aspects of proof compression

The complexity of propositional proofs in deep inference

On the logical complexity of cyclic arithmetic

A cut-free cyclic proof system for Kleene Algebra

➤