In some recent works, Crupi and Iacona have outlined an analysis of ‘if’ based on Chrysippus’ idea that a conditional holds whenever the negation of its consequent is incompatible with its antecedent. This paper presents a sound and complete system of conditional logic that accommodates their analysis. The soundness and completeness proofs that will be provided rely on a general method elaborated by Raidl, which applies to a wide range of systems of conditional logic.

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)

This paper investigates the implicative conditional, a connective intended to describe the logical behavior of an empirically defined class of natural language conditionals, also namedimplicative 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⇒qis 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)

Recent studies indicate that indicative conditionals like "If people wear masks, the spread of Covid-19 will be diminished" require a probabilistic dependency between their antecedents and consequents to be acceptable (Skovgaard-Olsen et al., 2016). But it is easy to make the slip from this claim to the thesis that indicative conditionals are acceptable only if this probabilistic dependency results from a causal relation between antecedent and consequent. According to Pearl (2009), understanding a causal relation involves multiple, hierarchically organized conceptual dimensions: (...) prediction, intervention, and counterfactual dependence. In a series of experiments, we test the hypothesis that these conceptual dimensions are differentially encoded in indicative and counterfactual conditionals. If this hypothesis holds, then there are limits as to how much of a causal relation is captured by indicative conditionals alone. Our results show that the acceptance of indicative and counterfactual conditionals can become dissociated. Furthermore, it is found that the acceptance of both is needed for accepting a causal relation between two co-occurring events. The implications that these findings have for the hypothesis above, and for recent debates at the intersection of the psychology of reasoning and causal judgment, are critically discussed. Our findings are consistent with viewing indicative conditionals as answering predictive queries requiring evidential relevance (even in the absence of direct causal relations). Counterfactual conditionals in contrast target causal relevance, specifically. Finally, we discuss the implications our results have for the yet unsolved question of how reasoners succeed in constructing causal models from verbal descriptions. (shrink)

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)

This paper explores the connective ‘because’, based on the idea that ‘_C_ because _A_’ implies the acceptance/truth of the antecedent _A_ as well as of the consequent _C_, 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 antecedent _and_ (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)

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.

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)

The concept of an evidential conditional _If A then C_ that can be defined by the conjunction of \(A>C\) and \(\lnot C > \lnot 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 studies proof systems for the logics of super-strict implication \(\textsf{ST2}\) – \(\textsf{ST5}\), which correspond to C.I. Lewis’ systems \(\textsf{S2}\) – \(\textsf{S5}\) freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating \(\textsf{STn}\) in \(\textsf{Sn}\) and backsimulating \(\textsf{Sn}\) in \(\textsf{STn}\), respectively (for \({\textsf{n}} =2, \ldots, 5\) ). Next, \(\textsf{G3}\) -style labelled sequent calculi are investigated. It is shown that these calculi have the good structural properties that are distinctive (...) of \(\textsf{G3}\) -style calculi, that they are sound and complete, and it is shown that the proof search for \(\mathsf {G3.ST2}\) is terminating and therefore the logic is decidable. (shrink)

The Meno problem, asking for the surplus value of knowledge beyond the value of true justified belief, was recently much treated within reliabilist and virtue epistemologies. The answers from formal epistemology, by contrast, are quite poor. This paper attempts to improve the score of formal epistemology by precisely explicating Timothy Williamson's suggestion that ‘present knowledge is less vulnerable than mere present true belief to rational undermining by future evidence’. It does so by combining Nozick's sensitivity analysis of knowledge with Spohn's (...) fact‐asserting epistemic interpretation of conditionals. Accordingly, the surplus value of knowledge lies in a specific kind of stability of knowledge, which differs, though, from that claimed by other so‐called stability analyses of knowledge. (shrink)

Today there is a wealth of fascinating studies of connexive logical systems. But sometimes it looks as if connexive logic is still in search of a convincing interpretation that explains in intuitive terms _why_ the connexive principles should be valid. In this paper I argue that difference-making conditionals as presented in Rott (_Review of Symbolic Logic_ 15, 2022) offer one principled way of interpreting connexive principles. From a philosophical point of view, the idea of difference-making demands full, unrestricted connexivity, because (...) neither logical truths nor contradictions or other absurdities can ever ‘make a difference’ (i.e., be relevantly connected) to anything. However, difference-making conditionals have so far been only partially connexive. I show how the existing analysis of difference-making conditionals can be reshaped to obtain full connexivity. The classical AGM belief revision model is replaced by a conceivability-limited revision model that serves as the semantic base for the analysis. The key point of the latter is that the agent should never accept any absurdities. (shrink)

The present thesis focuses on counterfactuals. Specifically, we will address new questions and open problems that arise for the standard semantic accounts of counterfactual conditionals. The first four chapters deal with the Lewisian semantic account of counterfactuals. On a technical level, we contribute by providing an equivalent algebraic semantics for Lewis' variably strict conditional logics, which is notably absent in the literature. We introduce a new kind of algebra and differentiate between local and global versions of each of Lewis' variably (...) strict conditional logics. We study the algebraic properties of Lewis' logics and the structure theory of our newly introduced algebras. Additionally, we employ a new algebraic construction, based on the framework of Boolean algebras of conditionals, to provide an alternative semantics for Lewisian counterfactual conditionals. This semantic account allows us to establish new truth conditions for Lewisian counterfactuals, implying that Lewisian counterfactuals are definable conditionals, and each counterfactual can be characterized as a modality of a corresponding probabilistic conditional. We further extend these results by demonstrating that each Lewisian counterfactual can also be characterized as a modality of the corresponding Stalnaker conditional. The resulting formal semantic framework is much more expressive than the standard one and, in addition to providing new truth conditions for counterfactuals, it also allows us to define a new class of conditional logics falling into the broader framework of weak logics. On the philosophical side, we argue that our results shed new light on the understanding of Lewisian counterfactuals and prompt a conceptual shift in this field: Lewisian counterfactual dependence can be understood as a modality of probabilistic conditional dependence or Stalnakerian conditional dependence. In other words, whether a counterfactual connection occurs between A and B depends on whether it is "necessary" for a Stalnakerian/probabilistic dependence to occur between A and B. We also propose some ways to interpret the kind of necessity involved in this interpretation. The remaining two chapters deal with the probability of counterfactuals. We provide an answer to the question of how we can characterize the probability that a Lewisian counterfactual is true, which is an open problem in the literature. We show that the probability of a Lewisian counterfactual can be characterized in terms of belief functions from Dempster-Shafer theory of evidence, which are a super-additive generalization of standard probability. We define an updating procedure for belief functions based on the imaging procedure and show that the probability of a counterfactual A > B amounts to the belief function of B imaged on A. This characterization strongly relies on the logical results we proved in the previous chapters. Moreover, we also solve an open problem concerning the procedure to assign a probability to complex counterfactuals in the framework of causal modelling semantics. A limitation of causal modelling semantics is that it cannot account for the probability of counterfactuals with disjunctive antecedents. Drawing on the same previous works, we define a new procedure to assign a probability to counterfactuals with disjunctive antecedents in the framework of causal modelling semantics. We also argue that our procedure is satisfactory in that it yields meaningful results and adheres to some conceptually intuitive constraints one may want to impose when computing the probability of counterfactuals. (shrink)