A logical calculus for controlled monotonicity

Abstract

In this paper we introduce a new deductive framework for analyzing processes displaying a kind of controlled monotonicity. In particular, we prove the cut-elimination theorem for a calculus involving series-parallel structures over partial orders which is built up from multi-level sequents, an interesting variant of Gentzen-style sequents. More broadly, our purpose is to provide a general, syntactical tool for grasping the combinatorics of non-monotonic processes