Dr Abhishek De is a computer scientist with a theoretical focus, specialising in logic and its applications to programming languages, formal verification, and automated reasoning. Born and raised in Kolkata, he pursued higher education at the Chennai Mathematical Institute.  He earned his doctoral degree at Université Paris Cité, where he was trained in the French school of logic. Before joining Krea, he spent a few years in the UK as a Research Fellow.

Logic interweaves ideas from mathematics, computer science, and philosophy. Dr De’s research broadly falls into proof theory, one of the four pillars of logic. In his research, cyclic proofs serve as a unifying framework and by leveraging cyclic proofs, he has brought proof-theoretic insights to programming language theory and formal verification. Dr De has broad scope interests including linear logic, lambda calculus, automata theory, and reverse mathematics.

– Cyclic system for an algebraic theory of alternating parity automata. Das A. & De A. Accepted for publication at TABLEAUX 2025.

– Right-Linear Lattices: An Algebraic Theory of ω-Regular Languages via Fixed Points. Das A. & De A. Proceedings of MFCS 2025.

– Bounded Henkin quantifiers and the exponential time hierarchy. De A. ICLA 2025.

– The proof theory of right-linear (ω)-grammars via cyclic proofs. Das A. & De A. Proceedings of LICS 2024.

– The proof theory of (ω)-context-free languages via non-wellfounded proofs. Das A. & De A. Automated Reasoning, IJCAR 2024.

– Comparing infinitary systems for linear logic with fixed points. Das A., De A., & Saurin A. Proceedings of FSTTCS 2023.

– Phase semantics for linear logic with least and greatest fixed points. De A., Jafarrahmani F., & Saurin A. Proceedings of FSTTCS 2022.

– Decision problems for linear logic with least and greatest fixed points. Das A., De A., & Saurin A. Proceedings of FSCD 2022.

– Canonical proof-objects for coinductive programming: infinets with infinitely many cuts. De A., Pellissier L., & Saurin A. Proceedings of PPDP 2021.

– Infinets: The parallel syntax for non-wellfounded proof-theory. De A. & Saurin A. Proceedings of Tableaux 2019.

In addition to regular institutional teaching duties, Dr De frequently delivers graduate-level courses at  international graduate schools aimed at PhD students and professionals. He has also done multiple scientific outreach activities for high school students.