Anupam Das

Orcid: 0000-0002-0142-3676

Affiliations:
  • University of Birmingham, UK
  • University of Copenhagen, Denmark (former)
  • École Normale Supérieure de Lyon, France (former)
  • University of Bath, UK (PhD)


According to our database1, Anupam Das authored at least 42 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A proof theory of right-linear (omega-)grammars via cyclic proofs.
CoRR, 2024

A proof theory of right-linear (ω-)grammars via cyclic proofs.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

A Proof Theory of (ømega-)Context-Free Languages, via Non-wellfounded Proofs.
Proceedings of the Automated Reasoning - 12th International Joint Conference, 2024

Intuitionistic Gödel-Löb Logic, à la Simpson: Labelled Systems and Birelational Semantics.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023
Cyclic Hypersequent System for Transitive Closure Logic.
J. Autom. Reason., September, 2023

Enumerating Independent Linear Inferences.
Log. Methods Comput. Sci., 2023

On Intuitionistic Diamonds (and Lack Thereof).
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2023

Computational expressivity of (circular) proofs with fixed points.
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Comparing Infinitary Systems for Linear Logic with Fixed Points.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Cyclic Proofs for Arithmetical Inductive Definitions.
Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

Non-Uniform Complexity via Non-Wellfounded Proofs.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022
Cyclic Implicit Complexity.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Decision Problems for Linear Logic with Least and Greatest Fixed Points.
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

Proof Complexity of Monotone Branching Programs.
Proceedings of the Revolutions and Revelations in Computability, 2022

Cyclic Proofs, Hypersequents, and Transitive Closure Logic.
Proceedings of the Automated Reasoning - 11th International Joint Conference, 2022

Modal logic and the polynomial hierarchy: from QBFs to K and back.
Proceedings of the Advances in Modal Logic, AiML 2022, Rennes, France, 2022

2021
Proof complexity of positive branching programs.
CoRR, 2021

New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial.
Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

On the Logical Strength of Confluence and Normalisation for Cyclic Proofs.
Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

2020
A Functional (Monadic) Second-Order Theory of Infinite Trees.
Log. Methods Comput. Sci., 2020

On the logical complexity of cyclic arithmetic.
Log. Methods Comput. Sci., 2020

From QBFs to MALL and Back via Focussing.
J. Autom. Reason., 2020

A circular version of Gödel's T and its abstraction complexity.
CoRR, 2020

Beyond formulas-as-cographs: an extension of Boolean logic to arbitrary graphs.
CoRR, 2020

Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs.
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

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

2018
Left-Handed Completeness for Kleene algebra, via Cyclic Proofs.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices).
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

Focussing, MALL and the Polynomial Hierarchy.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2017
A Cut-Free Cyclic Proof System for Kleene Algebra.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017

2016
On linear rewriting systems for Boolean logic and some applications to proof theory.
Log. Methods Comput. Sci., 2016

From positive and intuitionistic bounded arithmetic to monotone proof complexity.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015
On the relative proof complexity of deep inference via atomic flows.
Log. Methods Comput. Sci., 2015

On Nested Sequents for Constructive Modal Logics.
Log. Methods Comput. Sci., 2015

No complete linear term rewriting system for propositional logic.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

A Complete Axiomatization of MSO on Infinite Trees.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
On the pigeonhole and related principles in deep inference and monotone systems.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Rewriting with Linear Inferences in Propositional Logic.
Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

2012
Complexity of Deep Inference via Atomic Flows.
Proceedings of the How the World Computes, 2012

2011
On the Proof Complexity of Cut-Free Bounded Deep Inference.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2011


  Loading...