Over the past ten years, the community researching connexive logics is rapidly growing and a number of papers have been published. However, when it comes to the terminology used in connexive logic, it seems to be not without problems. In this introduction, we aim at making a contribution towards both unifying and reducing the terminology. We hope that this can help making it easier to survey and access the field from outside the community of connexive logicians. Along the way, we (...) will make clear the context to which the papers in this special issue on Frontiers of Connexive Logic belong and contribute. (shrink)

Since McCall (1966), the heterodox principle of propositional logic that it is impossible for a proposition to be entailed by its own negation—in symbols, ¬(¬φ→φ)—has gone by the name of Aristotle’s thesis, since Aristotle apparently endorses it in Prior Analytics 2.4, 57b3–14. Scholars have contested whether Aristotle did endorse his eponymous thesis, whether he could do so consistently, and for what purpose he endorsed it if he did. In this article, I reconstruct Aristotle’s argument from this passage and show that (...) he accepts this thesis. Further, I show that the argument he gives is, making plausible assumptions, a correct proof in a consistent fragmentary nonclassical metalogic for a metatheorem he previously states concerning his assertoric syllogistic. In this way, Aristotle’s argument emerges as a fascinating case study in the use of a nonclassical metalogic to prove a result about a nonclassical object system. (shrink)

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

The relationship between formal logic and informal reasoning has always been a hot topic. In this paper, we propose another possible way to bring it up inspired by connexive logic. Our approach is based on the following presupposition: whatever method of formalizing informal reasoning you choose, there will always be some classically acceptable deductive principles that will have to be abandoned, and some desired schemes of argument that clearly are not classically valid. That way, we start with a new version (...) of connexive logic which validates Boethius’ Theses and quashes their converse from right to left. We provide a sound and complete axiomatization of this logic. We also study the implication-negation fragment of this logic supplied with Boolean negation as a second negation. (shrink)