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.
A logical calculus for controlled monotonicity / M. D'Agostino, M. Piazza, G. Pulcini. - In: JOURNAL OF APPLIED LOGIC. - ISSN 1570-8683. - 12:4(2014), pp. 558-569.
A logical calculus for controlled monotonicity
M. D'Agostino
;
2014
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.File | Dimensione | Formato | |
---|---|---|---|
1-s2.0-S1570868314000627-main.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
343.42 kB
Formato
Adobe PDF
|
343.42 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.