By and large, the conditional connective in three-valued logic has two different functions. First, by means of a deduction theorem, it can express a specific relation of logical consequence in the logical language itself. Second, it can represent natural language structures such as "if/then'' or "implies''. This chapter surveys both approaches, shows why none of them will typically end up with a three-valued material conditional, and elaborates on connections to probabilistic reasoning.

We defend a set of acceptance rules that avoids the lottery paradox, that is closed under classical entailment, and that accepts uncertain propositions without ad hoc restrictions. We show that the rules we recommend provide a semantics that validates exactly Adams’ conditional logic and are exactly the rules that preserve a natural, logical structure over probabilistic credal states that we call probalogic. To motivate probalogic, we first expand classical logic to geo-logic, which fills the entire unit cube, and then we (...) project the upper surfaces of the geo-logical cube onto the plane of probabilistic credal states by means of standard, linear perspective, which may be interpreted as an extension of the classical principle of indifference. Finally, we apply the geometrical/logical methods developed in the paper to prove a series of trivialization theorems against question-invariance as a constraint on acceptance rules and against rational monotonicity as an axiom of conditional logic in situations of uncertainty. (shrink)

Various semantics for studying the square of opposition have been proposed recently. So far, only [14] studied a probabilistic version of the square where the sentences were interpreted by (negated) defaults. We extend this work by interpreting sentences by imprecise (set-valued) probability assessments on a sequence of conditional events. We introduce the acceptability of a sentence within coherence-based probability theory. We analyze the relations of the square in terms of acceptability and show how to construct probabilistic versions of the square (...) of opposition by forming suitable tripartitions. Finally, as an application, we present a new square involving generalized quantifiers. (shrink)

In this paper we exploit the notions of conjoined and iterated conditionals, which are defined in the setting of coherence by means of suitable conditional random quantities with values in the interval [0,1]. We examine the iterated conditional (B|K)|(A|H), by showing that A|H p-entails B|K if and only if (B|K)|(A|H) = 1. Then, we show that a p-consistent family F={E1|H1, E2|H2} p-entails a conditional event E3|H3 if and only if E3|H3= 1, or (E3|H3)|QC(S) = 1 for some nonempty subset S (...) of F, where QC(S) is the quasi conjunction of the conditional events in S. Then, we examine the inference rules And, Cut, Cautious Monotonicity, and Or of System P and other well known inference rules (Modus Ponens, Modus Tollens, Bayes). We also show that QC(F)|C(F) = 1, where C(F) is the conjunction of the conditional events in F. We characterize p-entailment by showing that F p-entails E3|H3 if and only if (E3|H3)|C(F) = 1. Finally, we examine Denial of the antecedent and Affirmation of the consequent, where the p-entailment of (E3|H3) from F does not hold, by showing that (E3|H3)|C(F) is not equal to 1. (shrink)

Intuition says that choosing to create a miserable person is wrong, but choosing not to create a happy one is not; this is ‘the Asymmetry’. There is a complete theory which agrees – the ‘Harm Minimization’ theory. A well-known objection is that this theory rejects Parfit’s principle of ‘No Difference’. But No Difference has less intuitive support than the Asymmetry, and there seems to be no complete theory which agrees with both. There is, however, a more serious problem for Harm (...) Minimization: it says it is wrong to create happy people if we could have made some of them happier at the expense of others. The purpose of this note is to describe a complete theory which agrees with the Asymmetry and avoids this unacceptable consequence; like Harm Minimization, it rejects No Difference. (shrink)

Understanding the logical behavior of propositional attitudes, i.e. the mental states that we entertain with propositions (such as knowledge, belief, supposition, imagination, etc.), requires careful consideration of what such attitudes are about: their topic. This is the core intuition of Francesco Berto’s work, a book that fits into one of the most interesting and rich debates of recent decades, ranging over a wide variety of disciplines: from formal semantics to epistemology and even cognitive psychology. But above all, Berto’s book makes (...) a substantial contribution to what Daniel Nolan calls the hyperintensional revolution. In addition to being an original and ambitious proposal in the area of epistemic logic, the book can also be considered an excellent and in-depth introduction to many of the most interesting problems in the contemporary debate. (shrink)

Indicative conditionals and tendency causal claims are closely related (e.g., Frosch and Byrne, 2012), but despite these connections, they are usually studied separately. A unifying framework could consist in their dependence on probabilistic factors such as high conditional probability and statistical relevance (e.g., Adams, 1975; Eells, 1991; Douven, 2008, 2015). This paper presents a comparative empirical study on differences between judgments on tendency causal claims and indicative conditionals, how these judgments are driven by probabilistic factors, and how these factors differ (...) in their predictive power for both causal and conditional claims. (shrink)

The ontology of decision theory has been subject to considerable debate in the past, and discussion of just how we ought to view decision problems has revealed more than one interesting problem, as well as suggested some novel modifications of classical decision theory. In this paper it will be argued that Bayesian, or evidential, decision-theoretic characterizations of decision situations fail to adequately account for knowledge concerning the causal connections between acts, states, and outcomes in decision situations, and so they are (...) incomplete. Second, it will be argues that when we attempt to incorporate the knowledge of such causal connections into Bayesian decision theory, a substantial technical problem arises for which there is no currently available solution that does not suffer from some damning objection or other. From a broader perspective, this then throws into question the use of decision theory as a model of human or machine planning. (shrink)

Epistemic modal operators give rise to something very like, but also very unlike, Moore's paradox. I set out the puzzling phenomena, explain why a standard relational semantics for these operators cannot handle them, and recommend an alternative semantics. A pragmatics appropriate to the semantics is developed and interactions between the semantics, the pragmatics, and the definition of consequence are investigated. The semantics is then extended to probability operators. Some problems and prospects for probabilistic representations of content and context are explored.

When someone is asked to speak his mind, it is sometimes possible for him to furnish what his utterance appears to have omitted. In such cases we might say that he had a mind to speak. Sometimes, however, the opposite is true. Asked to speak his mind, our speaker finds that he has no mind to speak. When it is possible to speak one's mind and when not is largely determined by the kinds of beings we are and by the (...) kinds of resources we are able to draw upon. In either case, not speaking one's mind is leaving something out whose articulation would or could matter for the purposes for which one was speaking in the first place. Inarticulation is no fleetingly contingent and peripheral phenomenon in human thinking and discourse. It is a substantial and dominant commonplace. In Part One I attempt to say something about what it is about the human agent that makes inarticulateness so rife. In Part Two, I consider various strategies for making the unarticulated explicit, and certain constraints on such processes. I shall suggest, among other things, that standard treatments of enthymematic reconstruction are fundamentally misconceived. (shrink)

We define a semantics for conditionals in terms of stochastic graphs which gives a straightforward and simple method of evaluating the probabilities of conditionals. It seems to be a good and useful method in the cases already discussed in the literature, and it can easily be extended to cover more complex situations. In particular, it allows us to describe several possible interpretations of the conditional and to formalize some intuitively valid but formally incorrect considerations concerning the probabilities of conditionals under (...) these two interpretations. It also yields a powerful method of handling more complex issues. The stochastic graph semantics provides a satisfactory answer to Lewis’s arguments against the PC = CP principle, and defends important intuitions which connect the notion of probability of a conditional with the notion of conditional probability. It also illustrates the general problem of finding formal explications of philosophically important notions and applying mathematical methods in analyzing philosophical issues. (shrink)

According to the PCCP thesis, the probability of a conditional A → C is the conditional probability P. This claim is undermined by Lewis’ triviality results, which purport to show that apart from trivial cases, PCCP is not true. In the present article we show that the only rational, “Dutch Book-resistant” extension of the agent’s beliefs concerning non-conditional sentences A and C to the conditional A → C is by assuming that P = P. In other cases a diachronic Dutch (...) Book against the agent can be constructed. There is a tension between our findings and Lewis’ results, which needs to be explained. Therefore, we present a probability space which corresponds in a natural way to the diachronic Dutch Book—and which allows the conditional A → C to be interpreted as an event in a mathematically sound way. It also allows to formalize the notion of conditionalizing A → C on ¬C which plays a crucial role in Lewis’ proof. Our conclusion is that Lewis’ proof is circular, so it cannot be considered to be a sound argument against PCCP. (shrink)

We define a model for computing probabilities of right-nested conditionals in terms of graphs representing Markov chains. This is an extension of the model for simple conditionals from Wójtowicz and Wójtowicz. The model makes it possible to give a formal yet simple description of different interpretations of right-nested conditionals and to compute their probabilities in a mathematically rigorous way. In this study we focus on the problem of the probabilities of conditionals; we do not discuss questions concerning logical and metalogical (...) issues such as setting up an axiomatic framework, inference rules, defining semantics, proving completeness, soundness etc. Our theory is motivated by the possible-worlds approach ; however, our model is generally more flexible. In the paper we focus on right-nested conditionals, discussing them in detail. The graph model makes it possible to account in a unified way for both shallow and deep interpretations of right-nested conditionals. In particular, we discuss the status of the Import-Export Principle and PCCP. We briefly discuss some methodological constraints on admissible models and analyze our model with respect to them. The study also illustrates the general problem of finding formal explications of philosophically important notions and applying mathematical methods in analyzing philosophical issues. (shrink)

We define a semantics for conditionals in terms of stochastic graphs which gives a straightforward and simple method of evaluating the probabilities of conditionals. It seems to be a good and useful method in the cases already discussed in the literature, and it can easily be extended to cover more complex situations. In particular, it allows us to describe several possible interpretations of the conditional and to formalize some intuitively valid but formally incorrect considerations concerning the probabilities of conditionals under (...) these two interpretations. It also yields a powerful method of handling more complex issues. The stochastic graph semantics provides a satisfactory answer to Lewis’s arguments against the PC = CP principle, and defends important intuitions which connect the notion of probability of a conditional with the notion of conditional probability. It also illustrates the general problem of finding formal explications of philosophically important notions and applying mathematical methods in analyzing philosophical issues. (shrink)

Schulz has shown that the suppositional view of indicative conditionals leads to a corresponding view of epistemic modals. But his case backfires: the resulting theory of epistemic modals gets the facts wrong, and so we end up with a good argument against the suppositional view. I show how and why a dynamic view of indicative conditionals leads to a better theory of epistemic modals.

Chalmers and Hájek argue that on an epistemic reading of Ramsey’s test for the rational acceptability of conditionals, it is faulty. They claim that applying the test to each of a certain pair of conditionals requires one to think that one is omniscient or infallible, unless one forms irrational Moore-paradoxical beliefs. I show that this claim is false. The epistemic Ramsey test is indeed faulty. Applying it requires that one think of anyone as all-believing and if one is rational, to (...) think of anyone as infallible-if-rational. But this is not because of Moore-paradoxical beliefs. Rather it is because applying the test requires a certain supposition about conscious belief. It is important to understand the nature of this supposition. (shrink)

I outline and motivate a way of implementing a closest world theory of indicatives, appealing to Stalnaker's framework of open conversational possibilities. Stalnakerian conversational dynamics helps us resolve two outstanding puzzles for a such a theory of indicative conditionals. The first puzzle -- concerning so-called 'reverse Sobel sequences' -- can be resolved by conversation dynamics in a theoryneutral way: the explanation works as much for Lewisian counterfactuals as for the account of indicatives developed here. Resolving the second puzzle, by contrast, (...) relies on the interplay between the particular theory of indicative conditionals developed here and Stalnakerian dynamics. The upshot is an attractive resolution of the so-called "Gibbard phenomenon" for indicative conditionals. (shrink)

A bounded formula is a pair consisting of a propositional formula φ in the first coordinate and a real number within the unit interval in the second coordinate, interpreted to express the lower-bound probability of φ. Converting conjunctive/disjunctive combinations of bounded formulas to a single bounded formula consisting of the conjunction/disjunction of the propositions occurring in the collection along with a newly calculated lower probability is called absorption. This paper introduces two inference rules for effecting conjunctive and disjunctive absorption and (...) compares the resulting logical system, called System Y, to axiom System P. Finally, we demonstrate how absorption resolves the lottery paradox and the paradox of the preference. (shrink)

There is strong disagreement about whether indicative conditionals have truth values. In this paper, I present a new argument for the conclusion that indicative conditionals have truth values based on the claim that some true statements entail indicative conditionals. I then address four arguments that conclude that indicative conditionals lack truth values, showing them to be inadequate. Finally, I present further benefits to having a worldly view of conditionals, which supports the assignment of truth values to indicative conditionals. I conclude (...) that certain types of account of indicative conditionals, which have been ignored in the literature partly on the basis of assigning truth values to indicative conditionals, deserve consideration. (shrink)

An impossibility result pertaining to the aggregation of individual judgements is thought by many to have significant implications for political theory, social epistemology and metaphysics. When members of a group hold a rational set of judgments on some interconnected questions, the theorem shows, it isn't always (logically) possible for them to aggregate their judgements into a collective one in conformity with seemingly very plausible constraints. I reject one of the constraints which engender the dilemma. The analogy with the lottery paradox, (...) I argue, shows that rational belief needn't be consistent. So the alleged implications of the dilemma are dispelled. (shrink)

The standard semantics for counterfactuals ensures that any counterfactual with a true antecedent and true consequent is itself true. There have been many recent attempts to amend the standard semantics to avoid this result. I show that these proposals invalidate a number of further principles of the standard logic of counterfactuals. The case against the automatic truth of counterfactuals with true components does not extend to these further principles, however, so it is not clear that rejecting the latter should be (...) a consequence of rejecting the former. Instead I consider how one might defuse putative counterexamples to the truth of true-true counterfactuals. (shrink)

Are counterfactuals with true antecedents and consequents automatically true? That is, is Conjunction Conditionalization: if (X & Y), then (X > Y) valid? Stalnaker and Lewis think so, but many others disagree. We note here that the extant arguments for Conjunction Conditionalization are unpersuasive, before presenting a family of more compelling arguments. These arguments rely on some standard theorems of the logic of counterfactuals as well as a plausible and popular semantic claim about certain semifactuals. Denying Conjunction Conditionalization, then, requires (...) rejecting other aspects of the standard logic of counterfactuals, or else our intuitive picture of semifactuals. (shrink)

We establish a probabilized version of modus tollens, deriving from p(E|H)=a and p()=b the best possible bounds on p(). In particular, we show that p() 1 as a, b 1, and also as a, b 0. Introduction Probabilities of conditionals Conditional probabilities 3.1 Adams' thesis 3.2 Modus ponens for conditional probabilities 3.3 Modus tollens for conditional probabilities.

In this paper I explore a version of standard (expected utility) decision theory in which the probability parameter is interpreted as an objective chance believed by agents to obtain and values of this parameter are fixed by indicative conditionals linking possible actions with possible outcomes. After reviewing some recent developments centering on the common-cause counterexamples to the standard approach, I introduce and briefly discuss the key notions in my own approach. (This approach has essentially the same results as the causal (...) approach in common-cause cases.) I then discuss the Rule of Dominance and find, in the context of the present proposal, that it cannot serve as an independent source of action justification. Turning next to Newcomb''s Problem, I argue that the much discussed issue of back-tracking counterfactuals is something of a red herring for decision theory. Once the twin distractions of back-tracking counterfactuals and Dominance Reasoning are set aside the 1-box solution emerges as a natural consequence of the present proposal. It is of interest that this proposal agrees with the causal approach in the standard common-cause examples and the expected-utility approach in the Newcomb case: one can be smart and rich and keep on smoking. (shrink)

In this paper, I stress the utility of employing test-driven development (TDD) for conceiving logical systems. TDD, originally invented in the context of Extreme Programming, is a methodology widely used by software engineers to conceive and develop programs. Its main principle is to design the tests of the expected properties of the system before the development phase. I argue that this methodology is especially convenient in conceiving applied logics. Indeed, this technique is efficient with most decidable logics having a software (...) implementation. Having a clear list of the desired inferences right from the beginning makes it possible to refine the properties of the system step by step until its completion. I distinguish and detail seven advantages of the usage of TDD for the conception of a logical theory. Most importantly, this methodology increases the predictability of the inferential power of the theory. A second important benefit is that the time required for the conception of the logic goes down dramatically. This methodology will change both ideas and practices. Logic is no longer considered to be a formal science, but rather to be an empirical one. Research in the field is geared toward specific and concrete goals. Programs are considered tools used to verify the conformity of formal theories. To sum up, I defend the view that, in some situations, this way of designing a formal system brings significant benefits, and that the construction of new logics can be conducted similarly to the development of open source software. (shrink)

The commonplaces, all grammatically confused, are that ?conditionals? are ternary in structure, have ?antecedents? and conform to the traditional taxonomy. It is maintained en route that ?The bough will not break? is consistent with ?If the bough breaks ??, that there is no logical difference between ?future indicatives? and ?subjunctives?, and that there is a difference between the logic of propositions (e.g. ?The bough broke?) and that of judgments (?The bough will/might/could/should/must/needn't break?).

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 appropriateness, or acceptability, of a conditional does not just ‘go with’ the corresponding conditional probability. A condition of dependence is required as well. In this paper a particular notion of dependence is proposed. It is shown that under both a forward causal and a backward evidential reading of the conditional, this appropriateness condition reduces to conditional probability under some natural circumstances. Because this is in particular the case for the so-called diagnostic reading of the conditional, this analysis might help (...) to explain some of Douven and Verbrugge’s empirical observations. (shrink)

In this paper we discuss the new Tweety puzzle. The original Tweety puzzle was addressed by approaches in non-monotonic logic, which aim to adequately represent the Tweety case, namely that Tweety is a penguin and, thus, an exceptional bird, which cannot fly, although in general birds can fly. The new Tweety puzzle is intended as a challenge for probabilistic theories of epistemic states. In the first part of the paper we argue against monistic Bayesians, who assume that epistemic states can (...) at any given time be adequately described by a single subjective probability function. We show that monistic Bayesians cannot provide an adequate solution to the new Tweety puzzle, because this requires one to refer to a frequency-based probability function. We conclude that monistic Bayesianism cannot be a fully adequate theory of epistemic states. In the second part we describe an empirical study, which provides support for the thesis that monistic Bayesianism is also inadequate as a descriptive theory of cognitive states. In the final part of the paper we criticize Bayesian approaches in cognitive science, insofar as their monistic tendency cannot adequately address the new Tweety puzzle. We, further, argue against monistic Bayesianism in cognitive science by means of a case study. In this case study we show that Oaksford and Chater’s (2007, 2008) model of conditional inference—contrary to the authors’ theoretical position—has to refer also to a frequency-based probability function. (shrink)

We investigate a lattice of conditional logics described by a Kripke type semantics, which was suggested by Chellas and Segerberg – Chellas–Segerberg (CS) semantics – plus 30 further principles. We (i) present a non-trivial frame-based completeness result, (ii) a translation procedure which gives one corresponding trivial frame conditions for arbitrary formula schemata, and (iii) non-trivial frame conditions in CS semantics which correspond to the 30 principles.

Systems of logico-probabilistic (LP) reasoning characterize inference from conditional assertions interpreted as expressing high conditional probabilities. In the present article, we investigate four prominent LP systems (namely, systems O, P, Z, and QC) by means of computer simulations. The results reported here extend our previous work in this area, and evaluate the four systems in terms of the expected utility of the dispositions to act that derive from the conclusions that the systems license. In addition to conforming to the dominant (...) paradigm for assessing the rationality of actions and decisions, our present evaluation complements our previous work, since our previous evaluation may have been too severe in its assessment of inferences to false and uninformative conclusions. In the end, our new results provide additional support for the conclusion that (of the four systems considered) inference by system Z offers the best balance of error avoidance and inferential power. Our new results also suggest that improved performance could be achieved by a modest strengthening of system Z. (shrink)

The rule of adjunction is intuitively appealing and uncontroversial for deductive inference, but in situations where information can be uncertain, the rule is neither needed nor wanted for rational acceptance, as illustrated by the lottery paradox. Practical certainty is the acceptance of statements whose chances of error are smaller than a prescribed threshold parameter, when evaluated against an evidential corpus. We examine the failure of adjunction in relation to the threshold parameter for practical certainty, with an eye towards reinstating the (...) rule of adjunction in some restricted forms, by observing the conditions under which the overall chance of error of the joint statements can be variously bounded. (shrink)

According to methodological anti-exceptionalism, logic follows a scientific methodology. There has been some discussion about which methodology logic has. Authors such as Priest, Hjortland and Williamson have argued that logic can be characterized by an abductive methodology. We choose the logical theory that behaves better under a set of epistemic criteria. In this paper, I analyze some important discussions in the philosophy of logic, and I show that they presuppose different methodologies, involving different notions of evidence and different epistemic values. (...) I argue that, rather than having a specific methodology such as abductivism, logic can be characterized by methodological pluralism. This position can also be seen as the application of scientific pluralism to the realm of logic. (shrink)

The paper suggests a modal predicate logic that deals with classical quantification and modalities as well as intermediate operators, like “most” and “mostly”. Following up the theory of generalized quantifiers, we will understand them as two-placed operators and call them determiners. Quantifiers as well as modal operators will be constructed from them. Besides the classical deduction, we discuss a weaker probabilistic inference “therefore, probably” defined by symmetrical probability measures in Carnap’s style. The given probabilistic inference relates intermediate quantification to singular (...) statements: “Most S are P” does not logically entail that a particular individual S is also P, but it follows that this is probably the case, where the probability is not ascribed to the propositions but to the inference. We show how this system deals with single case expectations while predictions of statistical statements remain generally problematic. (shrink)

This paper presents an adaptive logic enhancement of conditional logics of normality that allows for defeasible applications of Modus Ponens to conditionals. In addition to the possibilities these logics already offer in terms of reasoning about conditionals, this way they are enriched by the ability to perform default inferencing. The idea is to apply Modus Ponens defeasibly to a conditional and a fact on the condition that it is ‘safe' to do so concerning the factual and conditional knowledge at hand. (...) It is for instance not safe if the given information describes exceptional circumstances: although birds usually fly, penguins are exceptional to this rule. The two adaptive standard strategies are shown to correspond to different intuitions, a skeptical and a credulous reasoning type, which manifest themselves in the handling of so-called floating conclusions. (shrink)

McGee argues that it is sometimes reasonable to accept both x and x-> without accepting y->z, and that modus ponens is therefore invalid for natural language indicative conditionals. Here, we examine McGee's counterexamples from a Bayesian perspective. We argue that the counterexamples are genuine insofar as the joint acceptance of x and x-> at time t does not generally imply constraints on the acceptability of y->z at t, but we use the distance-based approach to Bayesian learning to show that applications (...) of modus ponens are nevertheless guaranteed to be successful in an important sense. Roughly, if an agent becomes convinced of the premises of a modus ponens argument, then she should likewise become convinced of the argument's conclusion. Thus we take McGee's counterexamples to disentangle and reveal two distinct ways in which arguments can convince. Any general theory of argumentation must take stock of both. (shrink)

What distinguishes indicative conditionals from subjunctive conditionals, according to one popular view, is that the so-called Adams’ thesis holds for the former kind of conditionals but the so-called Skyrms’ thesis for the latter. According to a plausible metaphysical view, both conditionals and chances supervene on non-modal facts. But since chances do not supervene on facts about particular events but facts about event-types, the past as well as the future is chancy. Some philosophers have worried that this metaphysical view is incompatible (...) with the aforementioned view on the probability of conditionals. This paper however shows that there is no need to worry, as these views can all be simultaneously satisfied within the so-called Multidimensional Possible World Semantics for conditionals. (shrink)

Does the desirability of a proposition depend on whether it is true? Not according to the Invariance assumption, held by several notable philosophers. The Invariance assumption plays an important role in David Lewis’ famous arguments against the so-called Desire-as-Belief thesis (DAB), an anti-Humean thesis according to which a rational agent desires a proposition exactly to the degree that she believes the proposition to be desirable. But the assumption is of interest independently of Lewis’ arguments, for instance since both Richard Jeffrey (...) and James Joyce make the assumption (or, strictly speaking, accept a thesis that implies Invariance) in their influential books on decision theory. The main claim to be defended in this paper is that Invariance is incompatible with certain assumptions of decision theory. I show that the assumption fails on the most common interpretations of desirability and/or choice-worthiness found in decision theory. I moreover show that Invariance is inconsistent with Richard Jeffrey’s decision theory, on which Lewis’ arguments against DAB are based. Finally, I show that Invariance contradicts how we in general do and should think about conditional desirability. (shrink)

A uniform theory of conditionals is one which compositionally captures the behavior of both indicative and subjunctive conditionals without positing ambiguities. This paper raises new problems for the closest thing to a uniform analysis in the literature (Stalnaker, Philosophia, 5, 269–286 (1975)) and develops a new theory which solves them. I also show that this new analysis provides an improved treatment of three phenomena (the import-export equivalence, reverse Sobel-sequences and disjunctive antecedents). While these results concern central issues in the study (...) of conditionals, broader themes in the philosophy of language and formal semantics are also engaged here. This new analysis exploits a dynamic conception of meaning where the meaning of a symbol is its potential to change an agent’s mental state (or the state of a conversation) rather than being the symbol’s content (e.g. the proposition it expresses). The analysis of conditionals is also built on the idea that the contrast between subjunctive and indicative conditionals parallels a contrast between revising and consistently extending some body of information. (shrink)

The paper focuses on interpreting ceteris paribus conditions as normal conditions. After discussing six basic problems for the explication of normal conditions and seven interpretations that do not well solve those problems I turn to what I call the epistemic account. According to it the normal is, roughly, the not unexpected. This is developed into a rigorous constructive account of normal conditions, which makes essential use of ranking theory and in particular allows to explain the phenomenon of multiply exceptional conditions. (...) Finally, this static account is extended to a schematic dynamic model of how we may learn about those normal and exceptional conditions. (shrink)

Conditionals somehow express conditional beliefs. However, conditional belief is a bi-propositional attitude that is generally not truth-evaluable, in contrast to unconditional belief. Therefore, this article opts for an expressivistic semantics for conditionals, grounds this semantics in the arguably most adequate account of conditional belief, that is, ranking theory, and dismisses probability theory for that purpose, because probabilities cannot represent belief. Various expressive options are then explained in terms of ranking theory, with the intention to set out a general interpretive scheme (...) that is able to account for the most variegated usage of conditionals. The Ramsey test is only the first option. Relevance is another, familiar, but little understood item, which comes in several versions. This article adds a further family of expressive options, which is able to subsume also counterfactuals and causal conditionals, and indicates at the end how this family allows for partial recovery of truth conditions for conditionals. (shrink)

Conditional probability and selection-function approaches to chancy subjunctive conditionals are compared in a simple and transparent setting. They are seen to be alternative ways of calculating the same quantity. This unification extends from core cases to more peripheral cases.

Suppose that two competing norms, N1 and N2, can be identified such that a given person’s response can be interpreted as correct according to N1 but incorrect according to N2. Which of these two norms, if any, should one use to interpret such a response? In this paper we seek to address this fundamental problem by studying individual variation in the interpretation of conditionals by establishing individual profiles of the participants based on their case judgments and reflective attitudes. To investigate (...) the participants’ reflective attitudes we introduce a new experimental paradigm called the Scorekeeping Task. As a case study, we identify the participants who follow the Suppositional Theory of conditionals (N1) versus Inferentialism (N2) and investigate to what extent internally consistent competence models can be reconstructed for the participants on this basis. After extensive empirical investigations, an apparent reasoning error with and-to-if inferences was found in one of these two groups. The implications of this case study for debates on the proper role of normative considerations in psychology are discussed. (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)