| dc.creator | Piazza | |
| dc.creator | Mario; Pulcini | |
| dc.creator | Gabriele | |
| dc.date | 2017 | |
| dc.date | fev | |
| dc.date | 2017-11-13T13:12:10Z | |
| dc.date | 2017-11-13T13:12:10Z | |
| dc.date.accessioned | 2018-03-29T05:50:26Z | |
| dc.date.available | 2018-03-29T05:50:26Z | |
| dc.identifier | Journal Of Logic And Computation. Oxford Univ Press, v. 27, p. 21 - 40, 2017. | |
| dc.identifier | 0955-792X | |
| dc.identifier | 1465-363X | |
| dc.identifier | WOS:000397037900002 | |
| dc.identifier | 10.1093/logcom/exv051 | |
| dc.identifier | https://academic.oup.com/logcom/article-lookup/doi/10.1093/logcom/exv051 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/326822 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1363847 | |
| dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
| dc.description | 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. | |
| dc.description | 27 | |
| dc.description | 1 | |
| dc.description | 21 | |
| dc.description | 40 | |
| dc.description | FAPESP Post-Doc Grant, Sao Paulo State, Brazil [2013/22371-0] | |
| dc.description | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
| dc.language | English | |
| dc.publisher | Oxford Univ Press | |
| dc.publisher | Oxford | |
| dc.relation | Journal of Logic and Computation | |
| dc.rights | fechado | |
| dc.source | WOS | |
| dc.subject | Proof-theory | |
| dc.subject | Cut-elimination | |
| dc.subject | Context-sensitiveness | |
| dc.subject | Classical Logic | |
| dc.subject | Non-monotonicity | |
| dc.subject | Paraconsistency | |
| dc.title | Unifying Logics Via Context-sensitiveness | |
| dc.type | Artículos de revistas | |
