27 citations · 49 across the 15 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.LO2022
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…
cs.LO2022★ 1 cited
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…