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 object of this paper is to examine half and full connexive extensions of the basic regular conditional logic CR. Extensions of this system are of interest because it is among the strongest well-known systems of conditional logic that can be augmented with connexive theses without inconsistency resulting. These connexive extensions are characterized axiomatically and their relations to one another are examined proof-theoretically. Subsequently, algebraic semantics are given and soundness, completeness, and decidability are proved for each system. The semantics is (...) also used to establish independence results. Finally, a deontic interpretation of one of the systems is examined and defended. (shrink)

The paper studies the relation between systems of modal logic and systems of consequential implication, a non-material form of implication satisfying "Aristotle's Thesis" (p does not imply not p) and "Weak Boethius' Thesis" (if p implies q, then p does not imply not q). Definitions are given of consequential implication in terms of modal operators and of modal operators in terms of consequential implication. The modal equivalent of "Strong Boethius' Thesis" (that p implies q implies that p does not imply (...) not q) is identified. (shrink)

The basis of the paper is a logic of analytical consequential implication, CI.0, which is known to be equivalent to the well-known modal system KT thanks to the definition A → B = df A ⥽ B ∧ Ξ (Α, Β), Ξ (Α, Β) being a symbol for what is called here Equimodality Property: (□A ≡ □B) ∧ (◊A ≡ ◊B). Extending CI.0 (=KT) with axioms and rules for the so-called circumstantial operator symbolized by *, one obtains a system CI.0*Eq (...) in whose language one can define an operator ↠ suitable to formalize context-dependent conditionals (so to counterfactual conditionals) via the definition (Def ↠) A ↠ B = df *A ⥽ B ∧ Ξ (Α, Β).. The central problem of the paper is to identify inside CI.0*Eq + Def ↠ a set of axioms yielding the fragment consisting of all and only theorems in which only truth-functional operators and the two operators → and ↠ occur. This system, here called CI.0, is introduced in §3. In view of the intended purpose, it is introduced a complete and tableau-decidable system KTw, which is an extension of KT with axioms for the so-called quasi-variables w(A), w(B)… Three translation functions among the three languages used in the paper are then introduced. The first, Tr, maps every wff of form *A into wffs of form w(A) ∧ A and translates theorems of CI.0*Eq into theorems of KTw. The second, t°, translates theorems of CI.0 into theorems of CI.0*Eq by applying Def↠. A third one, t, translates theorems of CI.0 into theorems of KTw. As a consequence, it follows that t°A = TrtA. In §4 it is proved that CI.0 is complete w.r.t. the class of CI.0-models of form where f is a selection function and R an access relation. It is then proved (i) that CI.0 models may be converted into KTw-models; (ii) that the truth-value of a proposition in a world of a CI.0-model is preserved in the same world of the derived KTw-model; (iii) that A is a CI.0-thesis iff its translation tA is KTw-thesis. It follows that, if A is not a CI.0-thesis, tA is not a KTw-thesis, so also that TrtA is not a CI.0*Eq-thesis. Since t°A = TrtA and t°A is a function built on Def↠, this proves that every t°-translation of a CI.0-wff that is a CI.0*Eq-theorem is a CI.0-theorem. Since the converse proposition is proved in §2, their conjunction establishes the desired result. In the final section, it is proved that CI.0 is tableau-decidable, that ↠ is not a trivial operator and that ↠ enjoys the positive and negative properties required in §1 for context-dependent conditionals. Some final remarks suggest that studying the relations between CI.0 and systems of classical conditional logic may be a promising line of investigation. (shrink)

In this introduction, we offer an overview of main systems developed in the growing literature on connexive logic, and also point to a few topics that seem to be collecting attention of many of those interested in connexive logic. We will also make clear the context to which the papers in this special issue belong and contribute.

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)

This paper explores trivalent truth conditions for indicative conditionals, examining the “defective” truth table proposed by de Finetti and Reichenbach. On their approach, a conditional takes the value of its consequent whenever its antecedent is true, and the value Indeterminate otherwise. Here we deal with the problem of selecting an adequate notion of validity for this conditional. We show that all standard validity schemes based on de Finetti’s table come with some problems, and highlight two ways out of the predicament: (...) one pairs de Finetti’s conditional with validity as the preservation of non-false values, but at the expense of Modus Ponens; the other modifies de Finetti’s table to restore Modus Ponens. In Part I of this paper, we present both alternatives, with specific attention to a variant of de Finetti’s table proposed by Cooper and Cantwell. In Part II, we give an in-depth treatment of the proof theory of the resulting logics, DF/TT and CC/TT: both are connexive logics, but with significantly different algebraic properties. (shrink)

A contra-classical logic is a logic that, over the same language as that of classical logic, validates arguments that are not classically valid. In this paper I investigate whether there is a single, non-trivial logic that exhibits many features of already known contra-classical logics. I show that Mortensen’s three-valued connexive logic _M3V_ is one such logic and, furthermore, that following the example in building _M3V_, that is, putting a suitable conditional on top of the \(\{\sim, \wedge, \vee \}\) -fragment of (...) _LP_, one can get a logic exhibiting even more contra-classical features. (shrink)

Francez has suggested that connexivity can be predicated of connectives other than the conditional, in particular conjunction and disjunction. Since connexivity is not any connection between antecedents and consequents—there might be other connections among them, such as relevance—, my question here is whether Francez’s conjunction and disjunction can properly be called ‘connexive’. I analyze three ways in which those connectives may somehow inherit connexivity from the conditional by standing in certain relations to it. I will show that Francez’s connectives fail (...) all these three ways, and that even other connectives obtained by following more closely Wansing’s method to get a connexive conditional, fail to be connexive as well. (shrink)

Conditional logics were originally developed for the purpose of modeling intuitively correct modes of reasoning involving conditional—especially counterfactual—expressions in natural language. While the debate over the logic of conditionals is as old as propositional logic, it was the development of worlds semantics for modal logic in the past century that catalyzed the rapid maturation of the field. Moreover, like modal logic, conditional logic has subsequently found a wide array of uses, from the traditional (e.g. counterfactuals) to the exotic (e.g. conditional (...) obligation). Despite the close connections between conditional and modal logic, both the technical development and philosophical exploitation of the latter has outstripped that of the former, with the result that noticeable lacunae exist in the literature on conditional logic. My dissertation addresses a number of these underdeveloped frontiers, producing new technical insights and philosophical applications. -/- I contribute to the solution of a problem posed by Priest of finding sound and complete labeled tableaux for systems of conditional logic from Lewis' V-family. To develop these tableaux, I draw on previous work on labeled tableaux for modal and conditional logic; errors and shortcomings in recent work on this problem are identified and corrected. While modal logic has by now been thoroughly studied in non-classical contexts, e.g. intuitionistic and relevant logic, the literature on conditional logic is still overwhelmingly classical. Another contribution of my dissertation is a thorough analysis of intuitionistic conditional logic, in which I utilize both algebraic and worlds semantics, and investigate how several novel embedding results might shed light on the philosophical interpretation of both intuitionistic logic and conditional logic extensions thereof. -/- My dissertation examines deontic and connexive conditional logic as well as the underappreciated history of connexive notions in the analysis of conditional obligation. The possibility of interpreting deontic modal logics in such systems (via embedding results) serves as an important theoretical guide. A philosophically motivated proscription on impossible obligations is shown to correspond to, and justify, certain (weak) connexive theses. Finally, I contribute to the intensifying debate over counterpossibles, counterfactuals with impossible antecedents, and take—in contrast to Lewis and Williamson—a non-vacuous line. Thus, in my view, a counterpossible like "If there had been a counterexample to the law of the excluded middle, Brouwer would not have been vindicated" is false, not (vacuously) true, although it has an impossible antecedent. I exploit impossible (non-normal) worlds—originally developed to model non-normal modal logics—to provide non-vacuous semantics for counterpossibles. I buttress the case for non-vacuous semantics by making recourse to both novel technical results and theoretical considerations. (shrink)