On the Proof Complexity of Cut-Free Bounded Deep Inference. - Anupam Das 002 (TABLEAUX, 2011)

Complexity of Deep Inference via Atomic Flows. - Anupam Das 002 (CiE, 2012)

Rewriting with Linear Inferences in Propositional Logic. - Anupam Das 002 (RTA, 2013)

On the pigeonhole and related principles in deep inference and monotone systems. - Anupam Das 002 (CSL-LICS, 2014)

A Complete Axiomatization of MSO on Infinite Trees. - Anupam Das 002; Colin Riba (LICS, 2015)

No complete linear term rewriting system for propositional logic. - Anupam Das 002; Lutz Straßburger (RTA, 2015)

On Nested Sequents for Constructive Modal Logics. - Ryuta Arisaka; Anupam Das 002; Lutz Straßburger (Log. Methods Comput. Sci., 2015)

On the relative proof complexity of deep inference via atomic flows. - Anupam Das 002 (Log. Methods Comput. Sci., 2015)

Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic. - Patrick Baillot; Anupam Das 002 (CSL, 2016)

From positive and intuitionistic bounded arithmetic to monotone proof complexity. - Anupam Das 002 (LICS, 2016)

On linear rewriting systems for Boolean logic and some applications to proof theory. - Anupam Das 002; Lutz Straßburger (Log. Methods Comput. Sci., 2016)

A Cut-Free Cyclic Proof System for Kleene Algebra. - Anupam Das 002; Damien Pous (TABLEAUX, 2017)

Focussing, MALL and the Polynomial Hierarchy. - Anupam Das 002 (IJCAR, 2018)

A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions. - Anupam Das 002; Isabel Oitavem (CSL, 2018)

Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices). - Anupam Das 002; Damien Pous (CSL, 2018)

Left-Handed Completeness for Kleene algebra, via Cyclic Proofs. - Anupam Das 002; Amina Doumane; Damien Pous (LPAR, 2018)

From QBFs to MALL and back via focussing: fragments of multiplicative additive linear logic for each level of the polynomial hierarchy. - Anupam Das 002 (CoRR, 2019)

Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs. - Sam Buss; Anupam Das 002; Alexander Knop (CSL, 2020)

Beyond formulas-as-cographs: an extension of Boolean logic to arbitrary graphs. - Cameron Calk; Anupam Das 002; Tim Waring (CoRR, 2020)

A circular version of Gödel's T and its abstraction complexity. - Anupam Das 002 (CoRR, 2020)

From QBFs to MALL and Back via Focussing. - Anupam Das 002 (J. Autom. Reason., 2020)

On the logical complexity of cyclic arithmetic. - Anupam Das 002 (Log. Methods Comput. Sci., 2020)

A Functional (Monadic) Second-Order Theory of Infinite Trees. - Anupam Das 002; Colin Riba (Log. Methods Comput. Sci., 2020)

On the Logical Strength of Confluence and Normalisation for Cyclic Proofs. - Anupam Das 002 (FSCD, 2021)

New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial. - Anupam Das 002; Alex A. Rice (FSCD, 2021)

Modal logic and the polynomial hierarchy: from QBFs to K and back. - Anupam Das 002; Sonia Marin (AiML, 2022)

Cyclic Proofs, Hypersequents, and Transitive Closure Logic. - Anupam Das 002; Marianna Girlando (IJCAR, 2022)

Proof Complexity of Monotone Branching Programs. - Anupam Das 002; Avgerinos Delkos (CiE, 2022)

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

Cyclic Implicit Complexity. - Gianluca Curzi; Anupam Das 002 (LICS, 2022)

Non-Uniform Complexity via Non-Wellfounded Proofs. - Gianluca Curzi; Anupam Das 002 (CSL, 2023)

Cyclic Proofs for Arithmetical Inductive Definitions. - Anupam Das 002; Lukas Melgaard (FSCD, 2023)

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

Computational expressivity of (circular) proofs with fixed points. - Gianluca Curzi; Anupam Das 002 (LICS, 2023)

On Intuitionistic Diamonds (and Lack Thereof). - Anupam Das 002; Sonia Marin (TABLEAUX, 2023)

Enumerating Independent Linear Inferences. - Anupam Das 002; Alex A. Rice (Log. Methods Comput. Sci., 2023)

Cyclic Hypersequent System for Transitive Closure Logic. - Anupam Das 002; Marianna Girlando (J. Autom. Reason., 2023)

Intuitionistic Gödel-Löb Logic, à la Simpson: Labelled Systems and Birelational Semantics. - Anupam Das 002; Iris van der Giessen; Sonia Marin (CSL, 2024)

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)

Proof Representations: From Theory to Applications (Dagstuhl Seminar 24341). - Anupam Das 002; Elaine Pimentel; Lutz Straßburger; Robin Martinot (Dagstuhl Reports, 2024)

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

Algebras for Automata: Reasoning with Regularity (Invited Talk). - Anupam Das 002 (STACS, 2025)

Proof complexity of positive branching programs. - Anupam Das 002; Avgerinos Delkos (Log. Methods Comput. Sci., 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)