2 results
Dirk Pattinson ; Lutz Schröder.
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide variety of logics outside the realm of normal […]
Published on March 17, 2011
Sergey Goncharov ; Lutz Schröder ; Christoph Rauch ; Maciej Piróg.
Models of iterated computation, such as (completely) iterative monads, often depend on a notion of guardedness, which guarantees unique solvability of recursive equations and requires roughly that recursive calls happen only under certain guarding operations. On the other hand, many models of […]
Published on July 4, 2019