This paper discusses some key connexive principles construed as principles about reasons, that is, as principles that express logical properties of sentences of the form ‘p is a reason for q’. Its main goal is to show how the theory of reasons outlined by Crupi and Iacona, which is based on their evidential account of conditionals, yields a formal treatment of such sentences that validates a restricted version of the principles discussed, overcoming some limitations that affect most extant accounts of (...) conditionals. (shrink)

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)

Motivated by supplying a new strategy for connexive logic and a better semantics for conditionals so that negating a conditional amounts to negating its consequent under the condition, we propose a new semantics for connexive conditional logic, by combining Kleene’s three-valued logic and a slight modification of Stalnaker’s semantics for conditionals. In the new semantics, selection functions for selecting closest worlds for evaluating conditionals can be undefined. Truth and falsity conditions for conditionals are then supplemented with a precondition that the (...) selection function is defined. Based on the new semantics, we define six conditional logics by different classes of models, using two notions of validity, one preserving truth and the other preserving tolerant truth. We prove soundness and completeness of these logics and compare them with some conditional logics in the literature. Our partial function plus precondition strategy may be used in other semantic frameworks to generate more connexive logics. (shrink)

The term ‘hyperconnexive logic’ (or ‘hyperconnexivity’ in general) in relation to a certain logical system was coined by Sylvan to indicate that not only do Boethius’ theses hold in such a system, but also their converses. The plausibility of the latter was questioned by some connexive logicians. Without going into the discussion regarding the plausibility of hyperconnexivity and the converses of Boethius’ theses, this paper proposes a quite simple way to escape the hyperconnexivity within the semantic framework of Wansing-style constructive (...) connexive logics. In particular, we present a working method for escaping hyperconnexivity of constructive connexive logic $${{\textbf{C}}}$$, discuss the problem that creates an obstacle to using the same method in the case of logic $${{\textbf{C3}}}$$ and provide a possible solution to this problem that allows us to construct a logical theory which is similar to $${{\textbf{C3}}}$$ and free from hyperconnexivity. All new logics introduced in this paper are equipped with sound and complete Hilbert-style calculi, and their relationships with other well-known connexive logics are discussed. (shrink)

This paper discusses some key connexive principles construed as principles about reasons, that is, as principles that express logical properties of sentences of the form ‘_p_ is a reason for _q_’. Its main goal is to show how the theory of reasons outlined by Crupi and Iacona, which is based on their evidential account of conditionals, yields a formal treatment of such sentences that validates a restricted version of the principles discussed, overcoming some limitations that affect most extant accounts of (...) conditionals. (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)

Buridan endorsed the principles that any impossible, and a fortiori any self-contradictory, proposition entails each proposition. These principles are usually referred to as ‘Ex impossibili quodlibet’ (EIQ) and ‘Ex contradictione quodlibet’ (ECQ). Buridan further considered the instance ECCQ according to which any proposition follows from the conjunction of two contradictory propositions. Buridan showed how ECCQ can be proven by means the usual laws of conjunction and disjunction. Furthermore, he discovered that EIQ can be derived from ECCQ by means of the (...) principle that if a conclusion q follows from two premises, one of which is necessary, then q follows from the other premise alone. Buridan thought that this principle would be provable; but his proof turned out to be circular since it presupposed EIQ. Nevertheless, EIQ is validated by the definition of a ‘bona consequentia’. Somewhat more exactly, according to Buridan one may distinguish between inferences which are formally valid, ‘materially’ valid, and valid ‘as of now’. It is shown that formally valid inferences satisfy ECQ while ‘materially’ valid inferences satisfy EIQ. Furthermore, inferences which are valid ‘as of now’ satisfy the principle ‘Ex falso quodlibet’ saying that any false proposition ‘as of now’ entails every proposition. (shrink)