1 citations · 1 across the 4 of their papers we have counts for
5 papers
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…
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…
Dynamic Lockstep Processors for Applications with Functional Safety Relevance
Hans Dermot Doran, Timo Lang
Lockstep processing is a recognized technique for helping to secure functional-safety relevant processing against, for instance, single upset errors that might cause faulty executi…
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…