4 citations · 5 across the 4 of their papers we have counts for
4 papers · 1 filter
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…
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…