We present two approaches to investigate the validity of connexive principles and related formulas and properties within coherence-based probability logic. Connexive logic emerged from the intuition that conditionals of the formif not-A,thenA, should not hold, since the conditional’s antecedentnot-Acontradicts its consequentA. Our approaches cover this intuition by observing that the only coherent probability assessment on the conditional event$${A| \overline{A}}$$A|A¯is$${p(A| \overline{A})=0}$$p(A|A¯)=0. In the first approach we investigate connexive principles within coherence-based probabilistic default reasoning, by interpreting defaults and negated defaults in terms (...) of suitable probabilistic constraints on conditional events. In the second approach we study connexivity within the coherence framework of compound conditionals, by interpreting connexive principles in terms of suitable conditional random quantities. After developing notions of validity in each approach, we analyze the following connexive principles:Aristotle’s theses,Aristotle’s Second Thesis,Abelard’s First Principle, andBoethius’ theses. We also deepen and generalize some principles and investigate further properties related to connexive logic (likenon-symmetry). Both approaches satisfyminimalrequirements for a connexive logic. Finally, we compare both approaches conceptually. (shrink)

At APr 2.4 57a36–13, Aristotle presents a notorious reductio argument in which he derives the claim ‘If B is not large, B is large’ and calls that result impossible. Aristotle is thus committed to some form of connexivity and this paper argues that his commitment is to a strong form of connexivity which excludes even cases in which ‘B is large’ is necessary. It is further argued that Aristotle’s view of connexivity is best understood as arising from his analysis of (...) affirmation and negation in terms of combination and separation: a proposition that separates two terms cannot entail a proposition that combines the same two terms. In order to motivate this account of connexivity, this paper interprets Aristotle as emphasising the predicative structure, especially the copulae, of the argument’s component propositions. The arguments for this are based on a consideration of the larger context of APr 2.2–4. A reconstruction of the argument using propositional variables does not fully capture Aristotle’s intentions. (shrink)

One of the main controversies of the Logic Schools of the 12th century centered on the question: What follows from the impossible? In this paper arguments for two diametrically opposed positions are examined. The author of the ‘Avranches Text’ who probably belonged to the school of the Parvipontani defended the view that from an impossible proposition everything follows (‘Ex impossibili quodlibet’). In particular he developed a proof to show that by means of so-called ‘disjunctive syllogism’ any arbitrary proposition B can (...) be logically derived from a pair of contradictory propositions A and Not-A. The author of the Ars Meliduna instead argued that nothing follows from an impossible proposition (‘ex falso nihil sequitur’). This view is supported by various counterexamples which aimed to show that the admission of impossible premises would give rise to inconsistent conclusions. Upon closer analysis these inconsistencies do not, however, have the formal structure of a real contradiction like A and Not-A, but rather the structure of two rivalling conditionals like ‘If B then A’ and ‘If B then Not-A’. Hence these counterexamples rather have to be considered as refutations of the basic principles of ‘connexive logic’. (shrink)

In “Lectio 55” of his Notule libri Priorum, Robert Kilwardby discussed various objections that had been raised against Aristotle’s Theses. The first thesis, AT1, says that no proposition q is implied both by a proposition p and by its negation, ∼p. AT2 says that no proposition p is implied by its own negation. In Prior Analytics, Aristotle had shown that AT2 entails AT1, and he argued that the assumption of a proposition p such that (∼p → p) would be “absurd”. (...) The unrestricted validity of AT1, AT2, however, is at odds with other principles which were widely accepted by medieval logicians, namely the law Ex Impossibili Quodlibet, EIQ, and the rules of disjunction introduction. Since, according to EIQ, the impossible proposition (p ∧ ∼p) implies every proposition, it also implies ∼(p∧∼p), in contradiction to AT2. Furthermore, by way of disjunction introduction, the proposition (p∨∼p) is implied both by p and by ∼p, in contradiction to AT1. Kilwardby tried to defend AT1, AT2 against these objections by claiming that EIQ holds only for accidental but not for natural implications. The second argument, however, cannot be refuted in this way because Kilwardby had to admit that every disjunction (p ∨ q) is naturally implied by its disjuncts. He therefore introduced the further requirement that, in order to constitute a genuine counterexample to AT1, (p → q) and (∼p → q) have to hold “by virtue of the same thing”. In a recently published paper, Spencer Johnston accepted this futile defence of AT1 and developed a formal semantics that would fit Kilwardby’s presumably connexive implication. This procedure, however, is misguided because the remaining considerations of Lesson 55  which were entirely ignored by Johnston  show that Kilwardby eventually recognized that AT2 is bound to fail. After all he concluded: “So it should be granted that from the impossible its opposite follows, and that the necessary follows from its opposite”. (shrink)

Alberic of Paris put forward an argument, ‘the most embarrassing of all twelfth-century arguments’ according to Christopher Martin, which shows that the connexive principles contradict some other logical principles that have become deeply entrenched in our most widely accepted logical theories. Building upon some of Everett Nelson’s ideas, we will show that the steps in Alberic of Paris’ argument that should be rejected are precisely the ones that presuppose the validity of schemas that are nowadays taken as some of the (...) most trivial logical truths: (A∧B) → A and (A∧B) → B, i.e. Simplification. (shrink)

The aim of this paper is to present a system of modal connexive logic based on a situation semantics. In general, modal connexive logics are extensions of standard modal logics that incorporate Aristotle’s and Boethius’ theses, that is the thesis that a sentence cannot imply its negation and the thesis that a sentence cannot imply a pair of contradictory sentences. A key problem in devising a connexive logic is to come up with a system that is both sufficiently strong to (...) fulfill some specific connexive theses and sufficiently well-motivated from a semantical point of view. The approach proposed here tries to address this problem by defining an appropriate connexive relation in terms of more basic notions. The result is a well-motivated system of modal connexive logic that nicely fits in both with the traditional ideas concerning the connexive conditional and with the current developments in connexive logic. (shrink)

In this paper, I investigate whether the intuitions that make connexive logics seem plausible might lie in pragmatic phenomena, rather than the semantics of conditional statements. I conclude that pragmatics indeed underwrites these intuitions, at least for indicative statements. Whether this has any effect on logic choice (and what that effect might be), however, heavily depends on one’s semantic theory of conditionals and on how one chooses to logically treat pragmatic failures.

The “official” history of connexive logic was written in 2012 by Storrs McCall who argued that connexive logic was founded by ancient logicians like Aristotle, Chrysippus, and Boethius; that it was further developed by medieval logicians like Abelard, Kilwardby, and Paul of Venice; and that it was rediscovered in the 19th and twentieth century by Lewis Carroll, Hugh MacColl, Frank P. Ramsey, and Everett J. Nelson. From 1960 onwards, connexive logic was finally transformed into non-classical calculi which partly concur with (...) systems of relevance logic and paraconsistent logic. In this paper it will be argued that McCall’s historical analysis is fundamentally mistaken since it doesn’t take into account two versions of connexivism. While “humble” connexivism maintains that connexive properties only apply to “normal” antecedents, “hardcore” connexivism insists that they also hold for “abnormal” propositions. It is shown that the overwhelming majority of the forerunners of connexive logic were only “humble” connexivists. Their ideas concerning connexive implication don’t give rise, however, to anything like a non-classical logic. (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)

In this paper, I investigate whether the intuitions that make connexive logics seem plausible might lie in pragmatic phenomena, rather than the semantics of conditional statements. I conclude that pragmatics indeed underwrites these intuitions, at least for indicative statements. Whether this has any effect on logic choice, however, heavily depends on one’s semantic theory of conditionals and on how one chooses to logically treat pragmatic failures.