Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnupam Das 0002
Person information
- affiliation: University of Birmingham, UK
- affiliation (former): University of Copenhagen, Denmark
- affiliation (former): École Normale Supérieure de Lyon, France
- affiliation (PhD): University of Bath, UK
Other persons with the same name
- Anupam Das 0001
![[0000-0002-8961-9963]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-8961-9963")
— North Carolina State University, Raleigh, NC, USA (and 3 more) - Anupam Das 0003 — National Institute of Technology Patna, India (and 1 more)
- Anupam Das 0004 — Rajiv Gandhi University, Arunachal Pradesh, India
- Anupam Das 0005 — Cotton University, India
- Anupam Das 0006 — Chittagong University of Engineering and Technology, Chottogram, Bangladesh
- Anupam Das 0007 — Royal Global University, Guwahati, Assam, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Anupam Das, Marianna Girlando:
Cyclic Hypersequent System for Transitive Closure Logic. J. Autom. Reason. 67(3): 27 (2023)- [j7]Anupam Das, Alex A. Rice:
Enumerating Independent Linear Inferences. Log. Methods Comput. Sci. 19(2) (2023) - [c25]Gianluca Curzi, Anupam Das:
Non-Uniform Complexity via Non-Wellfounded Proofs. CSL 2023: 16:1-16:18 - [c24]Anupam Das, Lukas Melgaard:
Cyclic Proofs for Arithmetical Inductive Definitions. FSCD 2023: 27:1-27:18 - [c23]Gianluca Curzi, Anupam Das:
Computational expressivity of (circular) proofs with fixed points. LICS 2023: 1-13 - [c22]Anupam Das, Sonia Marin:
On Intuitionistic Diamonds (and Lack Thereof). TABLEAUX 2023: 283-301 - [i13]Gianluca Curzi, Anupam Das:
Computational expressivity of (circular) proofs with fixed points. CoRR abs/2302.14825 (2023) - [i12]Anupam Das, Iris van der Giessen, Sonia Marin:
Intuitionistic Gödel-Löb logic, à la Simpson: labelled systems and birelational semantics. CoRR abs/2309.00532 (2023) - 2022
- [c21]Anupam Das, Sonia Marin:
Modal logic and the polynomial hierarchy: from QBFs to K and back. AiML 2022: 329-348 - [c20]Anupam Das, Marianna Girlando:
Cyclic Proofs, Hypersequents, and Transitive Closure Logic. IJCAR 2022: 509-528 - [c19]Anupam Das, Avgerinos Delkos:
Proof Complexity of Monotone Branching Programs. CiE 2022: 74-87 - [c18]Anupam Das, Abhishek De, Alexis Saurin:
Decision Problems for Linear Logic with Least and Greatest Fixed Points. FSCD 2022: 20:1-20:20 - [c17]Gianluca Curzi, Anupam Das:
Cyclic Implicit Complexity. LICS 2022: 19:1-19:13 - [i11]Anupam Das, Marianna Girlando:
Cyclic Proofs, Hypersequents, and Transitive Closure Logic. CoRR abs/2205.08616 (2022) - [i10]Gianluca Curzi, Anupam Das:
Non-uniform complexity via non-wellfounded proofs. CoRR abs/2211.16104 (2022) - 2021
- [c16]Anupam Das, Alex A. Rice:
New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial. FSCD 2021: 14:1-14:19 - [c15]Anupam Das:
On the Logical Strength of Confluence and Normalisation for Cyclic Proofs. FSCD 2021: 29:1-29:23 - [e1]Anupam Das, Sara Negri:
Automated Reasoning with Analytic Tableaux and Related Methods - 30th International Conference, TABLEAUX 2021, Birmingham, UK, September 6-9, 2021, Proceedings. Lecture Notes in Computer Science 12842, Springer 2021, ISBN 978-3-030-86058-5 [contents] - [i9]Anupam Das, Avgerinos Delkos:
Proof complexity of positive branching programs. CoRR abs/2102.06673 (2021) - [i8]Gianluca Curzi, Anupam Das:
Cyclic Implicit Complexity. CoRR abs/2110.01114 (2021) - [i7]Anupam Das, Alex A. Rice:
Enumerating Independent Linear Inferences. CoRR abs/2111.05209 (2021) - 2020
- [j6]Anupam Das:
From QBFs to MALL and Back via Focussing. J. Autom. Reason. 64(7): 1221-1245 (2020) - [j5]Anupam Das:
On the logical complexity of cyclic arithmetic. Log. Methods Comput. Sci. 16(1) (2020) - [j4]Anupam Das, Colin Riba:
A Functional (Monadic) Second-Order Theory of Infinite Trees. Log. Methods Comput. Sci. 16(4) (2020) - [c14]Sam Buss, Anupam Das, Alexander Knop:
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs. CSL 2020: 12:1-12:17 - [i6]Cameron Calk, Anupam Das, Tim Waring:
Beyond formulas-as-cographs: an extension of Boolean logic to arbitrary graphs. CoRR abs/2004.12941 (2020) - [i5]Anupam Das:
A circular version of Gödel's T and its abstraction complexity. CoRR abs/2012.14421 (2020)
2010 – 2019
- 2019
- [i4]Anupam Das, Colin Riba:
A Functional (Monadic) Second-Order Theory of Infinite Trees. CoRR abs/1903.05878 (2019) - [i3]Anupam Das:
From QBFs to MALL and back via focussing: fragments of multiplicative additive linear logic for each level of the polynomial hierarchy. CoRR abs/1906.03611 (2019) - [i2]Sam Buss, Anupam Das, Alexander Knop:
Proof complexity of systems of (non-deterministic) decision trees and branching programs. CoRR abs/1910.08503 (2019) - 2018
- [c13]Anupam Das:
Focussing, MALL and the Polynomial Hierarchy. IJCAR 2018: 689-705 - [c12]Anupam Das, Isabel Oitavem:
A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions. CSL 2018: 18:1-18:17 - [c11]Anupam Das, Damien Pous:
Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices). CSL 2018: 19:1-19:18 - [c10]Anupam Das, Amina Doumane, Damien Pous:
Left-Handed Completeness for Kleene algebra, via Cyclic Proofs. LPAR 2018: 271-289 - [i1]Anupam Das:
On the logical complexity of cyclic arithmetic. CoRR abs/1807.10248 (2018) - 2017
- [c9]Anupam Das, Damien Pous:
A Cut-Free Cyclic Proof System for Kleene Algebra. TABLEAUX 2017: 261-277 - 2016
- [j3]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) - [c8]Patrick Baillot, Anupam Das:
Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic. CSL 2016: 40:1-40:18 - [c7]Anupam Das:
From positive and intuitionistic bounded arithmetic to monotone proof complexity. LICS 2016: 126-135 - 2015
- [j2]Anupam Das:
On the relative proof complexity of deep inference via atomic flows. Log. Methods Comput. Sci. 11(1) (2015) - [j1]Ryuta Arisaka, Anupam Das, Lutz Straßburger:
On Nested Sequents for Constructive Modal Logics. Log. Methods Comput. Sci. 11(3) (2015) - [c6]Anupam Das, Colin Riba:
A Complete Axiomatization of MSO on Infinite Trees. LICS 2015: 390-401 - [c5]Anupam Das, Lutz Straßburger:
No complete linear term rewriting system for propositional logic. RTA 2015: 127-142 - 2014
- [c4]Anupam Das:
On the pigeonhole and related principles in deep inference and monotone systems. CSL-LICS 2014: 36:1-36:10 - 2013
- [c3]Anupam Das:
Rewriting with Linear Inferences in Propositional Logic. RTA 2013: 158-173 - 2012
- [c2]Anupam Das:
Complexity of Deep Inference via Atomic Flows. CiE 2012: 139-150 - 2011
- [c1]Anupam Das:
On the Proof Complexity of Cut-Free Bounded Deep Inference. TABLEAUX 2011: 134-148
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-21 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
