Monotonicity in Logic and Complexity

Project Information

MiLC

Grant agreement ID: 753431

DOI

10.3030/753431

Project closed

EC signature date 17 March 2017

Start date 1 September 2017

End date 31 August 2019

Funded under

• EXCELLENT SCIENCE - Marie Skłodowska-Curie Actions

Total cost

€ 200 194,80

EU contribution

€ 200 194,80

Coordinated by

KOBENHAVNS UNIVERSITET
Denmark

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Book chapters (1)

Focussing, $$\mathsf {MALL}$$ and the Polynomial Hierarchy

Author(s): Anupam Das
Published in: Automated Reasoning, Issue 10900, 2018, Page(s) 689-705, ISBN 978-3-319-94204-9
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-94205-6_45

Conference proceedings (3)

Left-Handed Completeness for Kleene algebra, via Cyclic Proofs

Author(s): Anupam Das, Amina Doumane, Damien Pous
Published in: EPiC Series in Computing volume 57, 2018, Page(s) 271-251
Publisher: EasyChair
DOI: 10.29007/hzq3

Non-Wellfounded Proof Theory For (Kleene+Action)(Algebras+Lattices)

Author(s): Anupam Das, Damien Pous
Published in: 27th EACSL Annual Conference on Computer Science Logic (CSL 2018), 2018, Page(s) 19:1--19:18
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.csl.2018.19

A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions

Author(s): Anupam Das, Isabel Oitavem
Published in: 27th EACSL Annual Conference on Computer Science Logic (CSL 2018), 2018
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.csl.2018.18

Other (4)

A Functional (Monadic) Second-Order Theory of Infinite Trees

Author(s): Anupam Das, Colin Riba
Published in: 2019
Publisher: arXiv

On the logical complexity of cyclic arithmetic

Author(s): Das, Anupam
Published in: Issue 1, 2019
Publisher: arXiv

Proof complexity of systems of (non-deterministic) decision trees and branching programs

Author(s): Sam Buss, Anupam Das, Alexander Knop
Published in: 2019
Publisher: arXiv

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

Author(s): Das, Anupam
Published in: Issue 1, 2019
Publisher: arXiv