CLE e-Prints http://www.cle.unicamp.br/eprints/index.php/CLE_e-Prints <p><span style="font-family: Arial,Helvetica;"><span style="font-size: xx-small;"><img src="/eprints/public/site/images/Administrador/cle-e-prints.png" alt=""></span></span></p> <p><span style="font-family: Arial,Helvetica;"><span style="font-size: xx-small;">The <strong><em>CLE e-Prints</em></strong> of CLE-UNICAMP are preprints of academic articles, individual or thematically organized (under conference proceedings or special issues) of which at least one of the authors or editors is an official member, or an associated researcher, or a visiting researcher of CLE, or is attached to some academic group of CLE.</span></span></p> Centre for Logic, Epistemology and the History of Science - CLE en-US CLE e-Prints 1519-9681 Recovery operators, paraconsistency and duality http://www.cle.unicamp.br/eprints/index.php/CLE_e-Prints/article/view/997 <p align="justify">There are two foundational but not properly developed ideas in da Costa’s approach to paraconsistency: the ‘well-behavedness’ operator and the duality between paraconsistent and intuitionistic logics. The aim of this paper is to present how these two ideas can be developed by Logics of Formal Inconsistency (LFIs) and Logics of Formal Undeterminedness (LFUs). LFIs recover the validity of the principle of explosion in a paraconsistent scenario, and LFUs recover the validity of the excluded middle in a paracomplete scenario. We will present two formal systems, the logics mbC and mbD, that display the duality between paraconsistency and paracompleteness as a duality between inference rules added to a common core – in the case studied here, classical positive propositional logic (CPL+). mbC and mbD are equipped with recovery operators that restore classical logic for, respectively, consistent and determined propositions. Then, we combine these two logics obtaining logics of formal inconsistency and undeterminedness (LFIUs), called mbCD and mbCDE. The swap structures semantics framework for LFIs, is adapted here for LFUs and LFIUs. This semantics allows us to prove the decidability of the proposed systems by means of finite non-deterministic matrices.</p> Walter Carnielli Marcelo Esteban Coniglio Abilio Rodrigues ##submission.copyrightStatement## 2017-10-20 2017-10-20 17 1