1 citations · 1 across the 3 of their papers we have counts for
3 papers · 1 filter
A theory of cut-restriction: first steps
Agata Ciabattoni, Timo Lang, Revantha Ramanayake
Cut-elimination is the bedrock of proof theory. It is the algorithm that eliminates cuts from a sequent calculus proof that leads to cut-free calculi and applications. Cut-eliminat…
Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics
A. R. Balasubramanian, Timo Lang, Revantha Ramanayake
We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FLew (i.e. IMALLW) that have a cut-free hypersequent proo…
A Game Model for Proofs with Costs
Timo Lang, Carlos Olarte, Elaine Pimentel +1
We look at substructural calculi from a game semantic point of view, guided by certain intuitions about resource conscious and, more specifically, cost conscious reasoning. To this…