This paper studies proof systems for the logics of super-strict implication ST2–ST5, which correspond to C.I. Lewis’ systems S2–S5 freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating STn in Sn and backsimulating Sn in STn, respectively(for n=2,...,5). Next, G3-style labelled sequent calculi are investigated. It is shown that these calculi have the good structural properties that are distinctive of G3-style calculi, that they are sound and complete, and (...) it is shown that the proof search for G3. ST2 is terminating and therefore the logic is decidable. (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)

According to the analysis of concessive conditionals suggested by Crupi and Iacona, a concessive conditional $$p{{\,\mathrm{\hookrightarrow }\,}}q$$ p ↪ q is adequately formalized as a conjunction of conditionals. This paper presents a sound and complete axiomatic system for concessive conditionals so understood. The soundness and completeness proofs that will be provided rely on a method that has been employed by Raidl, Iacona, and Crupi to prove the soundness and completeness of an analogous system for evidential conditionals.

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)

This paper develops the idea that valid arguments are equivalent to true conditionals by combining Kripke’s theory of truth with the evidential account of conditionals offered by Crupi and Iacona. As will be shown, in a first-order language that contains a naïve truth predicate and a suitable conditional, one can define a validity predicate in accordance with the thesis that the inference from a conjunction of premises to a conclusion is valid when the corresponding conditional is true. The validity predicate (...) so defined significantly increases our expressive resources and provides a coherent formal treatment of paradoxical arguments. (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)

This paper develops the idea that valid arguments are equivalent to true conditionals by combining Kripke’s theory of truth with the evidential account of conditionals offered by Crupi and Iacona. As will be shown, in a first-order language that contains a naïve truth predicate and a suitable conditional, one can define a validity predicate in accordance with the thesis that the inference from a conjunction of premises to a conclusion is valid when the corresponding conditional is true. The validity predicate (...) so defined significantly increases our expressive resources and provides a coherent formal treatment of paradoxical arguments. (shrink)

Necessity and sufficiency are the building blocks of all successful explanations. Yet despite their importance, these notions have been conceptually underdeveloped and inconsistently applied in explainable artificial intelligence, a fast-growing research area that is so far lacking in firm theoretical foundations. In this article, an expanded version of a paper originally presented at the 37th Conference on Uncertainty in Artificial Intelligence, we attempt to fill this gap. Building on work in logic, probability, and causality, we establish the central role of (...) necessity and sufficiency in XAI, unifying seemingly disparate methods in a single formal framework. We propose a novel formulation of these concepts, and demonstrate its advantages over leading alternatives. We present a sound and complete algorithm for computing explanatory factors with respect to a given context and set of agentive preferences, allowing users to identify necessary and sufficient conditions for desired outcomes at minimal cost. Experiments on real and simulated data confirm our method’s competitive performance against state of the art XAI tools on a diverse array of tasks. (shrink)

InSuppose and Tell, Williamson makes a new and original attempt to defend the material conditional account of indicative conditionals. His overarching argument is that this account offers the best explanation of the data concerning how people evaluate and use such conditionals. We argue that Williamson overlooks several important alternative explanations, some of which appear to explain the relevant data at least as well as, or even better than, the material conditional account does. Along the way, we also show that Williamson (...) errs at important junctures about what exactly the relevant data are. (shrink)

The Ramsey Test is considered to be the default test for the acceptability of indicative conditionals. I will argue that it is incompatible with some of the recent developments in conceptualizing conditionals, namely the growing empirical evidence for the _Relevance Hypothesis_. According to the hypothesis, one of the necessary conditions of acceptability for an indicative conditional is its antecedent being positively probabilistically relevant for the consequent. The source of the idea is _Evidential Support Theory_ presented in Douven (2008). I will (...) defend the hypothesis against alleged counterexamples, and show that it is supported by growing empirical evidence. Finally, I will present a version of the Ramsey test which incorporates the relevance condition and therefore is consistent with growing empirical evidence for the relevance hypothesis. (shrink)

We provide a new link between deductive and probabilistic reasoning fallacies. Illusory inferences from disjunction are a broad class of deductive fallacies traditionally explained by recourse to a matching procedure that looks for content overlap between premises. In two behavioral experiments, we show that this phenomenon is instead sensitive to real-world causal dependencies and not to exact content overlap. A group of participants rated the strength of the causal dependence between pairs of sentences. This measure is a near perfect predictor (...) of fallacious reasoning by an independent group of participants in illusory inference tasks with the same materials. In light of these results, we argue that all extant accounts of these deductive fallacies require non-trivial adjustments. Crucially, these novel _indirect_ illusory inferences from disjunction bear a structural similarity to seemingly unrelated _probabilistic reasoning_ problems, in particular the conjunction fallacy from the heuristics and biases literature. This structural connection was entirely obscure in previous work on these deductive problems, due to the theoretical and empirical focus on content overlap. We argue that this structural parallelism provides arguments against the need for rich descriptions and individuating information in the conjunction fallacy, and we outline a unified theory of deductive illusory inferences from disjunction and the conjunction fallacy, in terms of Bayesian confirmation theory. (shrink)

The concept of an evidential conditional If A then C that can be defined by the conjunction of A>C and ¬C>¬A, where > is a conditional of the kind introduced by Stalnaker and Lewis, has recently been studied in a series of papers by Vincenzo Crupi and Andrea Iacona. In this paper I argue that Crupi and Iacona’s central idea that contraposition captures the idea of evidential support cannot be maintained. I give examples showing that contraposition is neither necessary nor (...) sufficient for a conditional’s antecedent supporting its consequent. Crupi and Iacona’s alternative account of evidential conditionals that is based on a probabilistic measure of evidential support cannot add to the credentials of their modal account, because both the theoretical role of contraposition and the resulting logic are different in this account. (shrink)

This paper explores the connective ‘because’, based on the idea that ‘CbecauseA’ implies the acceptance/truth of the antecedentAas well as of the consequentC, and additionally that the antecedent makes a difference for the consequent. To capture this idea of difference-making a ‘relevantized’ version of the Ramsey Test for conditionals is employed that takes the antecedent to be relevant to the consequent in the following sense: a conditional is true/accepted in a state$$\sigma $$σjust in case (i) the consequent is true/accepted when$$\sigma (...) $$σis revised by the antecedentand(ii) the consequent fails to be true/accepted when$$\sigma $$σis revised by the antecedent’s negation. To extend this to a semantics for ‘because’, we add that (iii) the antecedent and (iv) the consequent are accepted/true in the state$$\sigma $$σ. We get metaphysical or doxastic interpretations of these clauses, depending on what we mean by a model and a state. We introduce several semantics known from suppositional conditionals, which we reinterpret for difference-making conditionals and ‘because’. We present a minimal logic for ‘because’ sentences and show how it can be extended in ways that parallel the hierarchy of extensions of the logic of suppositional conditionals. We establish correspondence results between axioms for ‘because’ and properties of states, and prove that the specified logics are sound with respect to the semantics. (shrink)

This paper investigates the implicative conditional, a connective intended to describe the logical behavior of an empirically defined class of natural language conditionals, also named implicative conditionals, which excludes concessive and some other conditionals. The implicative conditional strengthens the strict conditional with the possibility of the antecedent and of the contradictory of the consequent. $${p\Rightarrow q}$$ p ⇒ q is thus defined as $${\lnot } \Diamond {(p \wedge \lnot q) \wedge } \Diamond {p \wedge } \Diamond {\lnot q}$$ ¬ ◊ (...) ( p ∧ ¬ q ) ∧ ◊ p ∧ ◊ ¬ q. We explore the logical properties of this conditional in a reflexive normal Kripke semantics, provide an axiomatic system and prove it to be sound and complete for our semantics. The implicative conditional validates transitivity and contraposition, which we take to be integral parts of reasoning and communication. But it only validates restricted versions of strengthening the antecedent, right weakening, simplification, and rational monotonicity. Apparent counterexamples to some of these properties are explained as due to contextual factors. Finally, the implicative conditional avoids the paradoxes of material and strict implication, and validates some connexive principles such as Aristotle’s theses and weak Boethius’ thesis, as well as some highly entrenched principles of conditionals, such as conjunction of consequents, disjunction of antecedents, modus ponens, cautious monotonicity and cut. (shrink)

The variably strict analysis of conditionals does not only largely dominate the philosophical literature, since its invention by Stalnaker and Lewis, it also found its way into linguistics and psychology. Yet, the shortcomings of Lewis–Stalnaker’s account initiated a plethora of modifications, such as non-vacuist conditionals, presuppositional indicatives, perfect conditionals, or other conditional constructions, for example: reason relations, difference-making conditionals, counterfactual dependency, or probabilistic relevance. Many of these new connectives can be treated as strengthened or weakened conditionals. They are definable conditionals. (...) This article develops a technique to infer the logic for such definable conditionals from the known logic of the underlying defining conditional. The technique is applied to central examples. The results show that a large part of the zoo of conditionals arises from a basic conditional—a constant nucleus of the different contextual and conceptual variations of variably strict conditionals. (shrink)

According to the analysis of concessive conditionals suggested by Crupi and Iacona, a concessive conditional \(p{{\,\mathrm{\hookrightarrow }\,}}q\) is adequately formalized as a conjunction of conditionals. This paper presents a sound and complete axiomatic system for concessive conditionals so understood. The soundness and completeness proofs that will be provided rely on a method that has been employed by Raidl, Iacona, and Crupi to prove the soundness and completeness of an analogous system for evidential conditionals.

We introduce an expected-value theory of linguistic modality that makes reference to expected utility and a likelihood-based confirmation measure for deontics and epistemics, respectively. The account is a probabilistic semantics for deontics and epistemics, yet it proposes that deontics and epistemics share a common core modal semantics, as in traditional possible-worlds analysis of modality. We argue that this account is not only theoretically advantageous, but also has far-reaching empirical consequences. In particular, we predict modal versions of reasoning fallacies from the (...) heuristics and biases literature. Additionally, we derive the modal semantics in an entirely transparent manner, as it is based on the compositional semantics of Korean modal expressions that are morphosyntactically decomposed into a conditional and an evaluative predicate. (shrink)

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 an idea of Stoic descent that is largely neglected nowadays, the idea that an argument is valid when the conditional formed by the conjunction of its premises as antecedent and its conclusion as consequent is true. As it will be argued, once some basic features of our naıve understanding of validity are properly spelled out, and a suitable account of conditionals is adopted, the equivalence between valid arguments and true conditionals makes perfect sense. The account of validity (...) outlined here, which displays one coherent way to articulate the Stoic intuition, accords with standard formal treatments of deductive validity and encompasses an independently grounded characterization of inductive validity. (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)

This paper develops a probabilistic analysis of conditionals which hinges on a quantitative measure of evidential support. In order to spell out the interpreta- tion of ‘if’ suggested, we will compare it with two more familiar interpretations, the suppositional interpretation and the strict interpretation, within a formal framework which rests on fairly uncontroversial assumptions. As it will emerge, each of the three interpretations considered exhibits specific logical features that deserve separate consideration.

This paper investigates the logic of reasons. Its aim is to provide an analysis of the sentences of the form ‘p is a reason for q’ that yields a coherent account of their logical properties. The idea that we will develop is that ‘p is a reason for q’ is acceptable just in case a suitably defined relation of incompatibility obtains between p and ¬q. As we will suggest, a theory of reasons based on this idea can solve three challenging (...) puzzles that concern, respectively, contraposing reasons, conflicting reasons, and supererogatory reasons, and opens a new perspective on some classical issues concerning non-deductive inferences. (shrink)

This paper outlines an account of concessive conditionals that rests on two main ideas. One is that the logical form of a sentence as used in a given context is determined by the content expressed by the sentence in that context. The other is that a coherent distinction can be drawn between a reading of ‘if’ according to which a conditional is true when its consequent holds on the supposition that its antecedent holds, and a stronger reading according to which (...) a conditional is true when its antecedent supports its consequent. As we will suggest, the logical form of concessive conditionals can be elucidated by relying on this distinction. (shrink)

Timothy Williamson has defended the claim that the semantics of the indicative ‘if’ is given by the material conditional. Putative counterexamples can be handled by better understanding the role played in our assessment of indicatives by a fallible cognitive heuristic, called the Suppositional Procedure. Williamson’s Suppositional Conjecture has it that the Suppositional Procedure is humans’ primary way of prospectively assessing conditionals. This paper raises some doubts on the Suppositional Procedure and Conjecture.

Once upon a time, some thought that indicative conditionals could be effectively analyzed as material conditionals. Later on, an alternative theoretical construct has prevailed and received wide acceptance, namely, the conditional probability of the consequent given the antecedent. Partly following critical remarks recently ap- peared in the literature, we suggest that evidential support—rather than conditional probability alone—is key to understand indicative conditionals. There have been motivated concerns that a theory of evidential conditionals (unlike their more tra- ditional counterparts) cannot generate (...) a sufficiently interesting logical system. Here, we will describe results dispelling these worries. Happily, and perhaps surprisingly, appropriate technical variations of Ernst Adams’s classical approach allow for the construction of a logic of evidential conditionals with distinctive fea- tures, which is also well-behaved and reasonably strong. (shrink)

Describes the received theory of necessary and sufficient conditions, explains some standard objections to it, and lays out alternative ways of thinking about conditions and conditionals.

In my thesis, I develop two distinct themes. The first part of my thesis is devoted to indicative conditionals and approaching them from an empirically informed perspective. In the second part, I am developing classical topics of philosophy of science, specifically, scientific objectivity and the role of values in science, in connection to recent methodological developments, revolving around the Replication Crisis.

Proves Completeness for the Evidential Conditional.