4 citations · 5 across the 3 of their papers we have counts for
8 papers
Non-uniform complexity via non-wellfounded proofs
Gianluca Curzi, Anupam Das
Cyclic and non-wellfounded proofs are now increasingly employed to establish metalogical results in a variety of settings, in particular for type systems with forms of (co)inductio…
Cyclic Proofs, Hypersequents, and Transitive Closure Logic
Anupam Das, Marianna Girlando
We propose a cut-free cyclic system for Transitive Closure Logic (TCL) based on a form of hypersequents, suitable for automated reasoning via proof search. We show that previously…
Beyond formulas-as-cographs: an extension of Boolean logic to arbitrary graphs
Cameron Calk, Anupam Das, Tim Waring
We propose a graph-based extension of Boolean logic called Boolean Graph Logic (BGL). Construing formula trees as the cotrees of cographs, we may state semantic notions such as eva…
Proof complexity of systems of (non-deterministic) decision trees and branching programs
Sam Buss, Anupam Das, Alexander Knop
This paper studies propositional proof systems in which lines are sequents of decision trees or branching programs - deterministic and nondeterministic. The systems LDT and LNDT ar…
From QBFs to MALL and back via focussing: fragments of multiplicative additive linear logic for each level of the polynomial hierarchy
Anupam Das
In this work we investigate how to extract alternating time bounds from 'focussed' proof systems. Our main result is the obtention of fragments of MALLw (MALL with weakening) compl…
Some Fibonacci sequence spaces of non-absolute type derived from with and Hausdorff measure of non-compactness of composition operators
Anupam Das, Bipan Hazarika, Feyzi Başar
The aim of the paper is to introduce the spaces and derived by the composition of the two infinite matrices an…