Please use this identifier to cite or link to this item:
Type: Artigo
Title: Unifying Logics Via Context-sensitiveness
Author: Piazza
Mario; Pulcini
Abstract: 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.
Subject: Proof-theory
Classical Logic
Editor: Oxford Univ Press
Citation: Journal Of Logic And Computation. Oxford Univ Press, v. 27, p. 21 - 40, 2017.
Rights: fechado
Identifier DOI: 10.1093/logcom/exv051
Date Issue: 2017
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
000397037900002.pdf160.9 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.