Advanced search
Start date
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Unifying logics via context-sensitiveness

Full text
Piazza, Mario ; Pulcini, Gabriele
Total Authors: 2
Document type: Journal article
Source: JOURNAL OF LOGIC AND COMPUTATION; v. 27, n. 1, p. 21-40, FEB 2017.
Web of Science Citations: 6

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. (AU)

FAPESP's process: 13/22371-0 - Towards a unified setting for non-monotony and paraconsistency
Grantee:Gabriele Pulcini
Support type: Scholarships in Brazil - Post-Doctorate