Monotonicity in Logic and Complexity

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

Autores: Anupam Das
Publicado en: Automated Reasoning, Edición 10900, 2018, Página(s) 689-705, ISBN 978-3-319-94204-9
Editor: Springer International Publishing
DOI: 10.1007/978-3-319-94205-6_45

Left-Handed Completeness for Kleene algebra, via Cyclic Proofs

Autores: Anupam Das, Amina Doumane, Damien Pous
Publicado en: EPiC Series in Computing volume 57, 2018, Página(s) 271-251
Editor: EasyChair
DOI: 10.29007/hzq3

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

Autores: Anupam Das, Damien Pous
Publicado en: 27th EACSL Annual Conference on Computer Science Logic (CSL 2018), 2018, Página(s) 19:1--19:18
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.csl.2018.19

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

Autores: Anupam Das, Isabel Oitavem
Publicado en: 27th EACSL Annual Conference on Computer Science Logic (CSL 2018), 2018
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.csl.2018.18

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

Autores: Anupam Das, Colin Riba
Publicado en: 2019
Editor: arXiv

On the logical complexity of cyclic arithmetic

Autores: Das, Anupam
Publicado en: Edición 1, 2019
Editor: arXiv

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

Autores: Sam Buss, Anupam Das, Alexander Knop
Publicado en: 2019
Editor: arXiv

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

Autores: Das, Anupam
Publicado en: Edición 1, 2019
Editor: arXiv

Publicaciones

Compartir esta página

Descargar