| A cut-free cyclic proof system for Kleene algebra A Das, D Pous International Conference on Automated Reasoning with Analytic Tableaux and …, 2017 | 49 | 2017 |
| Non-wellfounded proof theory for (Kleene+ action)(algebras+ lattices) A Das, D Pous Computer Science Logic (CSL), 2018 | 46 | 2018 |
| On the logical complexity of cyclic arithmetic A Das Logical Methods in Computer Science 16, 2020 | 40 | 2020 |
| On nested sequents for constructive modal logics L Straßburger, A Das, R Arisaka Logical Methods in Computer Science 11, 2015 | 37 | 2015 |
| On the proof complexity of cut-free bounded deep inference A Das International Conference on Automated Reasoning with Analytic Tableaux and …, 2011 | 24 | 2011 |
| Left-Handed Completeness for Kleene algebra, via Cyclic Proofs. A Das, A Doumane, D Pous LPAR, 271-289, 2018 | 23 | 2018 |
| On linear rewriting systems for Boolean logic and some applications to proof theory A Das, L Straßburger Logical Methods in Computer Science 12, 2017 | 23 | 2017 |
| Complexity of deep inference via atomic flows A Das How the World Computes, 139-150, 2012 | 22 | 2012 |
| Rewriting with Linear Inferences in Propositional Logic A Das 24th International Conference on Rewriting Techniques and Applications (RTA …, 2013 | 21 | 2013 |
| No complete linear term rewriting system for propositional logic A Das, L Straßburger 26th International Conference on Rewriting Techniques and Applications (RTA …, 2015 | 16 | 2015 |
| A circular version of G\" odel's T and its abstraction complexity A Das arXiv preprint arXiv:2012.14421, 2020 | 14 | 2020 |
| On the pigeonhole and related principles in deep inference and monotone systems A Das Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 12 | 2014 |
| On the relative proof complexity of deep inference via atomic flows A Das Logical Methods in Computer Science, 2013 | 10 | 2013 |
| On the logical strength of confluence and normalisation for cyclic proofs A Das 6th International Conference on Formal Structures for Computation and …, 2021 | 9 | 2021 |
| Decision problems for linear logic with least and greatest fixed points A Das, A De, A Saurin 7th International Conference on Formal Structures for Computation and …, 2022 | 8 | 2022 |
| Non-uniform complexity via non-wellfounded proofs G Curzi, A Das arXiv preprint arXiv:2211.16104, 2022 | 7 | 2022 |
| A recursion-theoretic characterisation of the positive polynomial-time functions A Das, I Oitavem 27th EACSL Annual Conference on Computer Science Logic (CSL 2018), 2018 | 7 | 2018 |
| Cyclic implicit complexity G Curzi, A Das Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022 | 6 | 2022 |
| Brouwer meets kripke: constructivising modal logic A Das, S Marin The Proof Theory Blog, 2022 | 6 | 2022 |
| New minimal linear inferences in boolean logic independent of switch and medial A Das, AA Rice 6th International Conference on Formal Structures for Computation and …, 2021 | 6 | 2021 |
Damien PousCNRSVerified email at ens-lyon.fr
