Abhishek De

I am a Research Fellow in the Theory Group at the School of Computer Science at the University of Birmingham. I am funded by the UKRI Fellowship StrIP headed by Anupam Das. Formerly, I was a PhD student at IRIF, Université de Paris under Alexis Saurin. 

I am interested in structural proof theory and its interactions with automata theory. I am particularly interested in cyclic proof theory. Rueben Rowe maintains an up-to-date bibliography of cyclic proof theory literature.

Here is a brief CV.

• A Proof Theory of (omega-)Context-Free Languages, via Non-wellfounded Proofs. (with Anupam Das) arXiv

In Automated Reasoning, IJCAR 2024.

• A Proof Theory of Right-Linear (omega-)Grammars via Cyclic Proofs. (with Anupam Das) arXiv

In 39th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2024.

• Comparing Infinitary Systems for Linear Logic with Fixed Points. (with Anupam Das and Alexis Saurin) pdf

In 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023.

• Phase Semantics for Linear Logic with Least and Greatest Fixed Points. (with Farzad Jafarrahmani and Alexis Saurin) pdf

In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2022.

• Decision Problems for Linear Logic with Least and Greatest Fixed Points. (with Anupam Das and Alexis Saurin) pdf

In 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022.

• Canonical proof-objects for coinductive programming: infinets with infinitely many cuts. (with Luc Pellissier and Alexis Saurin)  HAL

In 23rd International Symposium on Principles and Practice of Declarative Programming, PPDP 2021.

• Infinets: the parallel syntax for non-wellfounded proof-theory. (with Alexis Saurin) HAL

In Automated Reasoning with Analytic Tableaux and Related Methods - 28th International Conference, TABLEAUX 2019.

I taught Introduction to Proof Theory with Iris van der Giessen at Midlands Graduate School 2024. The lecture notes can be found here.

I worked on proof-nets for multiplicative linear logic with fixed points in my PhD. I also worked on the complexity of provability and phase semantics of multiplicative additive linear logic with fixed points. (manuscript and slides)