1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LO2024★ 1 cited
Deducibility in the full Lambek calculus with weakening is HAck-complete
Vitor Greati, Revantha Ramanayake
We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level…
cs.LO2023
Cut-restriction: from cuts to analytic cuts
Agata Ciabattoni, Timo Lang, Revantha Ramanayake
Cut-elimination is the bedrock of proof theory with a multitude of applications from computational interpretations to proof analysis. It is also the starting point for important me…