Artículos de revistas
Unifying Logics Via Context-sensitiveness
Registro en:
Journal Of Logic And Computation. Oxford Univ Press, v. 27, p. 21 - 40, 2017.
0955-792X
1465-363X
WOS:000397037900002
10.1093/logcom/exv051
Autor
Piazza
Mario; Pulcini
Gabriele
Institución
Resumen
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) The goal of this article is to design a uniform proof-theoretical framework encompassing classical, non-monotonic and paraconsistent logic. This framework is obtained by the control sets logical device, a syntactical apparatus for controlling derivations. Abasic feature of control sets is that of leaving the underlying syntax of a proof system unchanged, while affecting the very combinatorial structure of sequents and proofs. We prove the cut-elimination theorem for a version of controlled propositional classical logic, i. e. the sequent calculus for classical propositional logic to which a suitable system of control sets is applied. Finally, we outline the skeleton of a new (positive) account of non- monotonicity and paraconsistency in terms of concurrent processes. 27 1 21 40 FAPESP Post-Doc Grant, Sao Paulo State, Brazil [2013/22371-0] Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)