A logical calculus for controlled monotonicity

Autor(es)

D'Agostino, Marcello ^[1] ; Piazza, Mario ^[2] ; Pulcini, Gabriele ^{[3, 4]}

Afiliação do(s) autor(es)

^[1] Univ Ferrara, Dipartimento Econ & Management, I-44100 Ferrara - Italy

^[2] Univ G dAnnunzio, Dipartirnento Sci Filosof Pedag & Econ Quantitat, Pescara - Italy

^[3] Univ Estadual Campinas, Dept Philosophy, Campinas, SP - Brazil

^[4] Univ Estadual Campinas, Ctr Log Epistemol & Hist Sci, Campinas, SP - Brazil

• Tipo de documento: Artigo Científico
• Fonte: JOURNAL OF APPLIED LOGIC; v. 12, n. 4, p. 558-569, DEC 2014.
• Citações Web of Science: 4

Resumo

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. (C) 2014 Elsevier B.V. All rights reserved. (AU)

• Processo FAPESP: 13/22371-0 - Em direção a um marco lógico unitário para a não-monotonidade e a paraconsistência
• Beneficiário: Gabriele Pulcini
• Modalidade de apoio: Bolsas no Brasil - Pós-Doutorado