3 papers
cs.LO2025
Computational expressivity of (circular) proofs with fixed points
Gianluca Curzi, Anupam Das
We study the computational expressivity of proof systems with fixed point operators, within the 'proofs-as-programs' paradigm. We start with a calculus muLJ (due to Clairambault) t…
cs.LO2025
Cyclic Implicit Complexity
Gianluca Curzi, Anupam Das
Circular (or cyclic) proofs have received increasing attention in recent years, and have been proposed as an alternative setting for studying (co)inductive reasoning. In particular…
cs.CC2025
Proof complexity of positive branching programs
Anupam Das, Avgerinos Delkos
We investigate the proof complexity of systems based on positive branching programs, i.e. non-deterministic branching programs (NBPs) where, for any 0-transition between two nodes,…