21 citations · 27 across the 6 of their papers we have counts for
Showing 2007Show all
2 papers · 1 filter
cs.LO2007★ 1 cited
On the computational complexity of cut-reduction
Klaus Aehlig, Arnold Beckmann
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation sys…
cs.LO2007★ 21 cited
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of<br> Automata
Klaus Aehlig
Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to…