No. |
Title |
Author |
Year |
---|

1 |
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs |
Buss, Sam et al. |
2020 |

2 |
A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions |
Das, Anupam et al. |
2018 |

3 |
Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices) |
Das, Anupam et al. |
2018 |

4 |
Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic |
Baillot, Patrick et al. |
2016 |

5 |
No complete linear term rewriting system for propositional logic |
Das, Anupam et al. |
2015 |

6 |
Rewriting with Linear Inferences in Propositional Logic |
Das, Anupam |
2013 |