Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory. - Abhishek De 001; Alexis Saurin (TABLEAUX, 2019)

Canonical proof-objects for coinductive programming: infinets with infinitely many cuts. - Abhishek De 001; Luc Pellissier; Alexis Saurin (PPDP, 2021)

Decision Problems for Linear Logic with Least and Greatest Fixed Points. - Anupam Das 002; Abhishek De 001; Alexis Saurin (FSCD, 2022)

Phase Semantics for Linear Logic with Least and Greatest Fixed Points. - Abhishek De 001; Farzad Jafarrahmani; Alexis Saurin (FSTTCS, 2022)

Linear logic with the least and greatest fixed points : truth semantics, complexity and a parallel syntax. (La logique linéaire avec les plus petits et les plus grands points fixes : la sémantique de vérité, la complexité, et une syntaxe parallèle). - Abhishek De 001 (2022)

Comparing Infinitary Systems for Linear Logic with Fixed Points. - Anupam Das 002; Abhishek De 001; Alexis Saurin (FSTTCS, 2023)

A Proof Theory of (ømega-)Context-Free Languages, via Non-wellfounded Proofs. - Anupam Das 002; Abhishek De 001 (IJCAR (2), 2024)

A proof theory of right-linear (ω-)grammars via cyclic proofs. - Anupam Das 002; Abhishek De 001 (LICS, 2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs. - Anupam Das 002; Abhishek De 001 (CoRR, 2024)

Bounded Henkin Quantifiers and the Exponential Time Hierarchy. - Abhishek De 001 (ICLA, 2025)

Right-Linear Lattices: An Algebraic Theory of ω-Regular Languages, with Fixed Points. - Anupam Das 002; Abhishek De 001 (MFCS, 2025)

Cyclic system for an algebraic theory of alternating parity automata. - Anupam Das 002; Abhishek De 001 (CoRR, 2025)

An algebraic theory of ω-regular languages, via μν-expressions. - Anupam Das 002; Abhishek De 001 (CoRR, 2025)