On the Provable Contradictions of the Connexive Logics C and C3
Open Access
- 29 July 2023
- journal article
- research article
- Published by Springer Nature in Journal of Philosophical Logic
- Vol. 52 (5) , 1355-1383
Abstract
Despite the tendency to be otherwise, some non-classical logics are known to validate formulas that are invalid in classical logic. A subclass of such systems even possesses pairs of a formula and its negation as theorems, without becoming trivial. How should these provable contradictions be understood? The present paper aims to shed light on aspects of this phenomenon by taking as samples the constructive connexive logic C, which is obtained by a simple modification of a system of constructible falsity, namely N4, as well as its non-constructive extension C3. For these systems, various observations concerning provable contradictions are made, using mainly a proof-theoretic approach. The topics covered in this paper include: how new contradictions are found from parts of provable contradictions; how to characterise provable contradictions in C3 that are constructive; how contradictions can be seen from the relative viewpoint of strong implication; and as an appendix an attempt at generating provable contradictions in C3.Keywords
Funding Information
- H2020 European Research Council (ERC-2020-ADG,101018280,ConLog)
This publication has 17 references indexed in Scilit:
- Constructive Logic with Strong Negation is a Substructural Logic. IIStudia Logica, 2008
- Constructive Logic with Strong Negation is a Substructural Logic. IStudia Logica, 2008
- Sequent and hypersequent calculi for abelian and łukasiewicz logicsACM Transactions on Computational Logic, 2005
- Logic and groupsLogic and Logical Philosophy, 2004
- Paraconsistent Logic2002
- Reasoning with logical bilatticesJournal of Logic, Language and Information, 1996
- Bilattices and the semantics of logic programmingThe Journal of Logic Programming, 1991
- Constructible falsity and inexact predicatesThe Journal of Symbolic Logic, 1984
- Aristotle's thesis in consistent and inconsistent logicsStudia Logica, 1984
- Tonk, Plonk and PlinkAnalysis, 1962