Anupam Das

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 44

Top Topics

Cut Elimination

Theorem Proving

Top Venues

Log. Methods Comput. Sci.

Publications

Anupam Das, Abhishek De
A Proof Theory of (ømega-)Context-Free Languages, via Non-wellfounded Proofs. IJCAR (2) (2024)
Anupam Das, Abhishek De
A proof theory of right-linear (ω-)grammars via cyclic proofs. LICS (2024)
Anupam Das, Abhishek De
A proof theory of (omega-)context-free languages, via non-wellfounded proofs. CoRR (2024)
Anupam Das, Iris van der Giessen, Sonia Marin
Intuitionistic Gödel-Löb Logic, à la Simpson: Labelled Systems and Birelational Semantics. CSL (2024)
Anupam Das, Abhishek De
A proof theory of right-linear (omega-)grammars via cyclic proofs. CoRR (2024)
Gianluca Curzi, Anupam Das
Computational expressivity of (circular) proofs with fixed points. LICS (2023)
Gianluca Curzi, Anupam Das
Computational expressivity of (circular) proofs with fixed points. CoRR (2023)
Anupam Das, Lukas Melgaard
Cyclic Proofs for Arithmetical Inductive Definitions. FSCD (2023)
Anupam Das, Sonia Marin
On Intuitionistic Diamonds (and Lack Thereof). TABLEAUX (2023)
Anupam Das, Iris van der Giessen, Sonia Marin
Intuitionistic Gödel-Löb logic, à la Simpson: labelled systems and birelational semantics. CoRR (2023)
Gianluca Curzi, Anupam Das
Non-Uniform Complexity via Non-Wellfounded Proofs. CSL (2023)
Anupam Das, Alex A. Rice
Enumerating Independent Linear Inferences. Log. Methods Comput. Sci. 19 (2) (2023)
Anupam Das, Abhishek De, Alexis Saurin
Comparing Infinitary Systems for Linear Logic with Fixed Points. FSTTCS (2023)
Anupam Das, Marianna Girlando
Cyclic Hypersequent System for Transitive Closure Logic. J. Autom. Reason. 67 (3) (2023)
Gianluca Curzi, Anupam Das
Non-uniform complexity via non-wellfounded proofs. CoRR (2022)
Gianluca Curzi, Anupam Das
Cyclic Implicit Complexity. LICS (2022)
Anupam Das, Marianna Girlando
Cyclic Proofs, Hypersequents, and Transitive Closure Logic. CoRR (2022)
Anupam Das, Marianna Girlando
Cyclic Proofs, Hypersequents, and Transitive Closure Logic. IJCAR (2022)
Anupam Das, Sonia Marin
Modal logic and the polynomial hierarchy: from QBFs to K and back. AiML (2022)
Anupam Das, Avgerinos Delkos
Proof Complexity of Monotone Branching Programs. CiE (2022)
Anupam Das, Abhishek De, Alexis Saurin
Decision Problems for Linear Logic with Least and Greatest Fixed Points. FSCD (2022)
Anupam Das, Alex A. Rice
New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial. FSCD (2021)
Gianluca Curzi, Anupam Das
Cyclic Implicit Complexity. CoRR (2021)
Anupam Das
On the Logical Strength of Confluence and Normalisation for Cyclic Proofs. FSCD (2021)
Anupam Das, Alex A. Rice
Enumerating Independent Linear Inferences. CoRR (2021)
Anupam Das, Avgerinos Delkos
Proof complexity of positive branching programs. CoRR (2021)
Anupam Das, Colin Riba
A Functional (Monadic) Second-Order Theory of Infinite Trees. Log. Methods Comput. Sci. 16 (4) (2020)
Sam Buss, Anupam Das, Alexander Knop
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs. CSL (2020)
Cameron Calk, Anupam Das, Tim Waring
Beyond formulas-as-cographs: an extension of Boolean logic to arbitrary graphs. CoRR (2020)
Anupam Das
From QBFs to MALL and Back via Focussing. J. Autom. Reason. 64 (7) (2020)
Anupam Das
A circular version of Gödel's T and its abstraction complexity. CoRR (2020)
Anupam Das
On the logical complexity of cyclic arithmetic. Log. Methods Comput. Sci. 16 (1) (2020)
Anupam Das
From QBFs to MALL and back via focussing: fragments of multiplicative additive linear logic for each level of the polynomial hierarchy. CoRR (2019)
Anupam Das, Colin Riba
A Functional (Monadic) Second-Order Theory of Infinite Trees. CoRR (2019)
Sam Buss, Anupam Das, Alexander Knop
Proof complexity of systems of (non-deterministic) decision trees and branching programs. CoRR (2019)
Anupam Das
Focussing, MALL and the Polynomial Hierarchy. IJCAR (2018)
Anupam Das, Isabel Oitavem
A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions. CSL (2018)
Anupam Das, Damien Pous
Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices). CSL (2018)
Anupam Das
On the logical complexity of cyclic arithmetic. CoRR (2018)
Anupam Das, Amina Doumane, Damien Pous
Left-Handed Completeness for Kleene algebra, via Cyclic Proofs. LPAR (2018)
Anupam Das, Damien Pous
A Cut-Free Cyclic Proof System for Kleene Algebra. TABLEAUX (2017)
Anupam Das, Lutz Straßburger
On linear rewriting systems for Boolean logic and some applications to proof theory. Log. Methods Comput. Sci. 12 (4) (2016)
Patrick Baillot, Anupam Das
Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic. CSL (2016)
Anupam Das
From positive and intuitionistic bounded arithmetic to monotone proof complexity. LICS (2016)
Anupam Das
On the relative proof complexity of deep inference via atomic flows. Log. Methods Comput. Sci. 11 (1) (2015)
Anupam Das, Lutz Straßburger
No complete linear term rewriting system for propositional logic. RTA (2015)
Ryuta Arisaka, Anupam Das, Lutz Straßburger
On Nested Sequents for Constructive Modal Logics. Log. Methods Comput. Sci. 11 (3) (2015)
Anupam Das, Colin Riba
A Complete Axiomatization of MSO on Infinite Trees. LICS (2015)
Anupam Das
On the pigeonhole and related principles in deep inference and monotone systems. CSL-LICS (2014)
Anupam Das
Rewriting with Linear Inferences in Propositional Logic. RTA (2013)
Anupam Das
Complexity of Deep Inference via Atomic Flows. CiE (2012)
Anupam Das
On the Proof Complexity of Cut-Free Bounded Deep Inference. TABLEAUX (2011)