This paper develops a trivalent semantics for the truth conditions and the probability of the natural language indicative conditional. Our framework rests on trivalent truth conditions first proposed by Cooper (1968) and Belnap (1973) and it yields two logics of conditional reasoning: (i) a logic C of certainty-preserving inference; and (ii) a logic U for uncertain reasoning that preserves the probability of the premises. We show systematic correspondences between trivalent and probabilistic representations of inferences in either framework, and we use (...) the distinction between the two systems to cast light on the validity of inferences such as Modus Ponens, Or-To-If, and Conditional Excluded Middle. Specifically, the conditional behaves monotonically in C, but non-monotonically in U; Modus Ponens is valid in C, but valid in U only for non-nested conditionals. The result is a unified account of the semantics and epistemology of indicative conditionals that can be fruitfully applied to analyzing the validity of conditional inferences. (shrink)

A counteridentical is a counterfactual with an identity statement in the antecedent. While counteridenticals generally seem non-trivial, most semantic theories for counterfactuals, when combined with the necessity of identity and distinctness, attribute vacuous truth conditions to such counterfactuals. In light of this, one could try to save the orthodox theories either by appealing to pragmatics or by denying that the antecedents of alleged counteridenticals really contain identity claims. Or one could reject the orthodox theory of counterfactuals in favor of a (...) hyperintensional semantics that accommodates non-trivial counterpossibles. In this paper, I argue that none of these approaches can account for all the peculiar features of counteridenticals. Instead, I propose a modified version of Lewis’s counterpart theory, which rejects the necessity of identity, and show that it can explain all the peculiar features of counteridenticals in a satisfactory way. I conclude by defending the plausibility of contingent identity from objections. (shrink)

Inquiry into the meaning of logical terms in natural language (‘and’, ‘or’, ‘not’, ‘if’) has generally proceeded along two dimensions. On the one hand, semantic theories aim to predict native speaker intuitions about the natural language sentences involving those logical terms. On the other hand, logical theories explore the formal properties of the translations of those terms into formal languages. Sometimes, these two lines of inquiry appear to be in tension: for instance, our best logical investigation into conditional connectives may (...) show that there is no conditional operator that has all the properties native speaker intuitions suggest if has. Indicative conditionals have famously been the source of one such tension, ever since the triviality proofs of both Lewis (1976) and Gibbard (1981) established conclusions which are in prima facie tension with ordinary judgments about natural language indicative conditionals. In a recent series of papers, Branden Fitelson has strengthened both triviality results (Fitelson 2013, 2015, 2016), revealing a common culprit: a logical schema known as IMPORT-EXPORT. Fitelson’s results focus the tension between the logical results and ordinary judgments, since IMPORT-EXPORT seems to be supported by intuitions about natural language. In this paper, we argue that the intuitions which have been taken to support IMPORT-EXPORT are really evidence for a closely related, but subtly different, principle. We show that the two principles are independent by showing how, given a standard assumption about the conditional operator in the formal language in which IMPORT-EXPORT is stated, many existing theories of indicative conditionals validate one, but not the other. Moreover, we argue that once we clearly distinguish these principles, we can use propositional anaphora to show that IMPORT-EXPORT is in fact not valid for natural language indicative conditionals (given this assumption about the formal conditional operator). This gives us a principled and independently motivated way of rejecting a crucial premise in many triviality results, while still making sense of the speaker intuitions which appeared to motivate that premise. We suggest that this strategy has broad application and an important lesson: in theorizing about the logic of natural language, we must pay careful attention to the translation between the formal languages in which logical results are typically proved, and natural languages which are the subject matter of semantic theory. (shrink)

In this paper, new evidence is presented for the assumption that the reason-relation reading of indicative conditionals ('if A, then C') reflects a conventional implicature. In four experiments, it is investigated whether relevance effects found for the probability assessment of indicative conditionals (Skovgaard-Olsen, Singmann, and Klauer, 2016a) can be classified as being produced by a) a conversational implicature, b) a (probabilistic) presupposition failure, or c) a conventional implicature. After considering several alternative hypotheses and the accumulating evidence from other studies as (...) well, we conclude that the evidence is most consistent with the Relevance Effect being the outcome of a conventional implicature. This finding indicates that the reason-relation reading is part of the semantic content of indicative conditionals, albeit not part of their primary truth-conditional content. (shrink)

I argue that the suppositional view of conditionals, which is quite popular for indicative conditionals, extends also to subjunctive or counterfactual conditionals. According to this view, conditional judgements should not be construed as factual, categorical judgements, but as judgements about the consequent under the supposition of the antecedent. The strongest evidence for the view comes from focusing on the fact that conditional judgements are often uncertain; and conditional uncertainty, which is a well-understood notion, does not function like uncertainty about matters (...) of fact. I argue that the evidence for this view is as strong for subjunctives as it is for indicatives. (shrink)

The new paradigm in the psychology of reasoning adopts a Bayesian, or prob- abilistic, model for studying human reasoning. Contrary to the traditional binary approach based on truth functional logic, with its binary values of truth and falsity, a third value that represents uncertainty can be introduced in the new paradigm. A variety of three-valued truth table systems are available in the formal literature, including one proposed by de Finetti. We examine the descriptive adequacy of these systems for natural language (...) indicative condi- tionals and bets on conditionals. Within our framework the so-called “defective” truth table, in which participants choose a third value when the antecedent of the indicative conditional is false, becomes a coherent response. We show that only de Finetti’s system has a good descriptive fit when uncer- tainty is the third value. (shrink)

Adams’s Thesis, the claim that the probabilities of indicative conditionals equal the conditional probabilities of their consequents given their antecedents, has proven impossible to accommodate within orthodox possible-world semantics. This essay proposes a modification to the orthodoxy that removes this impossibility. The starting point is a proposal by Jeffrey and Stalnaker that conditionals take semantic values in the unit interval, interpreting these (à la McGee) as their expected truth-values at a world. Their theories imply a false principle, namely, that the (...) probability of a conditional is independent of any proposition inconsistent with its antecedent. But they also point to something important, namely, that our uncertainty about conditionals is not confined to uncertainty about the facts (what the actual world is like) but also expresses uncertainty about the counterfacts (what the world would be like if one or another supposition were true). To capture this observation, this essay proposes that the semantic contents of conditionals be treated as sets of vectors of possible worlds, not singleton worlds, with the coordinates of each specifying the world that is or would be true under the supposition that it represents. The probabilities of truth for conditionals will then depend on the joint probabilities of the facts and counterfacts, the latter in turn depending on the mode of supposition. The implication of this treatment is that the probabilities of conditionals are conditional probabilities whenever the mode of supposition is evidential. (shrink)

In this study we investigate the influence of reason-relation readings of indicative conditionals and ‘and’/‘but’/‘therefore’ sentences on various cognitive assessments. According to the Frege-Grice tradition, a dissociation is expected. Specifically, differences in the reason-relation reading of these sentences should affect participants’ evaluations of their acceptability but not of their truth value. In two experiments we tested this assumption by introducing a relevance manipulation into the truth-table task as well as in other tasks assessing the participants’ acceptability and probability evaluations. Across (...) the two experiments a strong dissociation was found. The reason-relation reading of all four sentences strongly affected their probability and acceptability evaluations, but hardly affected their respective truth evaluations. Implications of this result for recent work on indicative conditionals are discussed. (shrink)

This paper presents a unified theory of the truth conditions and probability of indicative conditionals and their compounds in a trivalent framework. The semantics validates a Reduction Theorem: any compound of conditionals is semantically equivalent to a simple conditional. This allows us to validate Stalnaker's Thesis in full generality and to use Adams's notion of $p$-validity as a criterion for valid inference. Finally, this gives us an elegant account of Bayesian update with indicative conditionals, establishing that despite differences in meaning, (...) it is tantamount to learning a material conditional. (shrink)

The desirability of what actually occurs is often influenced by what could have been. Preferences based on such value dependencies between actual and counterfactual outcomes generate a class of problems for orthodox decision theory, the best-known perhaps being the so-called Allais Paradox. In this paper we solve these problems by extending Richard Jeffrey's decision theory to counterfactual prospects, using a multidimensional possible-world semantics for conditionals, and showing that preferences that are sensitive to counterfactual considerations can still be desirability maximising. We (...) end the paper by investigating the conditions necessary and sufficient for a desirability function to be an expected utility. It turns out that the additional conditions imply highly implausible epistemic principles. (shrink)

The Ramseyan thesis that the probability of an indicative conditional is equal to the corresponding conditional probability of its consequent given its antecedent is both widely confirmed and subject to attested counterexamples (e.g., McGee 2000, Kaufmann 2004). This raises several puzzling questions. For instance, why are there interpretations of conditionals that violate this Ramseyan thesis in certain contexts, and why are they otherwise very rare? In this paper, I raise some challenges to Stefan Kaufmann's account of why the Ramseyan thesis (...) sometimes fails, and motivate my own theory. On my theory, the proposition expressed by an indicative conditional is partially determined by a background partition, and hence its probability depends on the choice of such a partition. I hold that this background partition is contextually determined, and in certain conditions is set by a salient question under discussion in the context. I show how the resulting theory offers compelling answers to the puzzling questions raised by failures of the Ramseyan thesis. (shrink)

In previous published research (“Conditionals and Inferential Connections: A Hypothetical Inferential Theory,” Cognitive Psychology, 2018), we investigated experimentally what role the presence and strength of an inferential connection between a conditional’s antecedent and consequent plays in how people process that conditional. Our analysis showed the strength of that connection to be strongly predictive of whether participants evaluated the conditional as true, false, or neither true nor false. In this article, we re-analyse the data from our previous research, now focussing on (...) the semantics of conditionals rather than on how they are processed. Specifically, we use those data to compare the main extant semantics with each other and with inferentialism, a semantics according to which the truth of a conditional requires the presence of an inferential connection between the conditional’s component parts. (shrink)

In this paper we consider conditional random quantities (c.r.q.’s) in the setting of coherence. Based on betting scheme, a c.r.q. X|H is not looked at as a restriction but, in a more extended way, as \({XH + \mathbb{P}(X|H)H^c}\) ; in particular (the indicator of) a conditional event E|H is looked at as EH + P(E|H)H c . This extended notion of c.r.q. allows algebraic developments among c.r.q.’s even if the conditioning events are different; then, for instance, we can give a (...) meaning to the sum X|H + Y|K and we can define the iterated c.r.q. (X|H)|K. We analyze the conjunction of two conditional events, introduced by the authors in a recent work, in the setting of coherence. We show that the conjoined conditional is a conditional random quantity, which may be a conditional event when there are logical dependencies. Moreover, we introduce the negation of the conjunction and by applying De Morgan’s Law we obtain the disjoined conditional. Finally, we give the lower and upper bounds for the conjunction and disjunction of two conditional events, by showing that the usual probabilistic properties continue to hold. (shrink)

Suppositional theories of conditionals take apparent similarities between supposition and conditionals as a starting point, appealing to features of the former to provide an account of the latter. This paper develops a novel form of suppositional theory, one which characterizes the relationship at the level of semantics rather than at the level of speech acts. In the course of doing so, it considers a range of novel data which shed additional light on how conditionals and supposition interact.

Psychological research on people’s understanding of natural language connectives has traditionally used truth table tasks, in which participants evaluate the truth or falsity of a compound sentence given the truth or falsity of its components in the framework of propositional logic. One perplexing result concerned the indicative conditional if A then C which was often evaluated as true when A and C are true, false when A is true and C is false but irrelevant“ (devoid of value) when A is (...) false (whatever the value of C). This was called the “psychological defective table of the conditional.” Here we show that far from being anomalous the “defective” table pattern reveals a coherent semantics for the basic connectives of natural language in a trivalent framework. This was done by establishing participants’ truth tables for negation, conjunction, disjunction, conditional, and biconditional, when they were presented with statements that could be certainly true, certainly false, or neither. We review systems of three-valued tables from logic, linguistics, foundations of quantum mechanics, philosophical logic, and artificial intelligence, to see whether one of these systems adequately describes people’s interpretations of natural language connectives. We find that de Finetti’s (1936/1995) three-valued system is the best approximation to participants’ truth tables. (shrink)

The pattern of credences we are inclined to assign to counterfactuals challenges standard accounts of counterfactuals. In response to this problem, the paper develops a semantics of counterfactuals in terms of the epsilon-operator. The proposed semantics stays close to the standard account: the epsilon-operator substitutes the universal quantifier present in standard semantics by arbitrarily binding the open world-variable. Various applications of the suggested semantics are explored including, in particular, an explanation of how the puzzling credences in counterfactuals come about.

Adams’ thesis is generally agreed to be linguistically compelling for simple conditionals with factual antecedent and consequent. We propose a derivation of Adams’ thesis from the Lewis- Kratzer analysis of if-clauses as domain restrictors, applied to probability operators. We argue that Lewis’s triviality result may be seen as a result of inexpressibility of the kind familiar in generalized quantifier theory. Some implications of the Lewis- Kratzer analysis are presented concerning the assignment of probabilities to compounds of conditionals.

The connection between the probabilities of conditionals and the corresponding conditional probabilities has long been explored in the philosophical literature, but its implementation faces both technical obstacles and objections on empirical grounds. In this paper I ?rst outline the motivation for the probabilistic turn and Lewis’ triviality results, which stand in the way of what would seem to be its most straightforward implementation. I then focus on Richard Jeffrey’s ’random-variable’ approach, which circumvents these problems by giving up the notion that (...) conditionals denote propositions in the usual sense. Even so, however, the random-variable approach makes counterintuitive predictions in simple cases of embedded conditionals. I propose to address this problem by enriching the model with an explicit representation of causal dependencies. The addition of such causal information not only remedies the shortcomings of Jeffrey’s conditional, but also opens up the possibility of a uni?ed probabilistic account of indicative and counterfactual conditionals. (shrink)

Conditionals with conditional constituents pose challenges for _the Thesis_, the idea that the probability of a conditional is the corresponding conditional probability. This note is concerned with two proposals for overcoming those challenges, both inspired by early work of van Fraassen: the _Bernoulli Semantics_ associated with Stalnaker and Jeffrey, and augmented with a mechanism for obtaining “local probabilities” by Kaufmann; and a proposal by Bacon which I dub _Ordinal Semantics_. Despite differences in mathematical details and emphasis of presentation, both proposals (...) lend themselves for use as a basis for a modal-theoretic interpretation of embedded conditionals. The goal of this note is to compare the two frameworks by implementing a model for the interpretation of conditionals in each, based on the same underlying probability model for non-conditional sentences. I show that in the Ordinal model, certain sentences are assigned probabilities that do not accord with intuitions. This problem is familiar from the literature on Bernoulli models and can be addressed by introducing Kaufmann-style local probabilities into Ordinal models. I then show that Bernoulli Semantics has other limitations, in that it assigns probabilities in violation of the Thesis to certain very complex formulas. The upshot is that a fusion of the theories may be our best shot at getting the predictions right. (shrink)

This paper argues that two widely accepted principles about the indicative conditional jointly presuppose the falsity of one of the most prominent arguments against epistemological iteration principles. The first principle about the indicative conditional, which has close ties both to the Ramsey test and the “or‐to‐if” inference, says that knowing a material conditional suffices for knowing the corresponding indicative. The second principle says that conditional contradictions cannot be true when their antecedents are epistemically possible. Taken together, these principles entail that (...) it is impossible to be in a certain kind of epistemic state: namely, a state of ignorance about which of two partially overlapping bodies of knowledge corresponds to one's actual one. However, some of the more popular “margin for error” style arguments against epistemological iteration principles suggest that such states are not only possible, but commonplace. I argue that the tension between these views runs deep, arising just as much for non‐factive attitudes like belief, presupposition, and certainty. I also argue that this is worse news for those who accept the principles about the indicative conditional than it is for those who reject epistemological iteration principles. (shrink)

Given a basic conditional of the form, If A then C, individuals usually list three cases as possible: A and C, not‐A and not‐C, not‐A and C. This result corroborates the theory of mental models. By contrast, individuals often judge that the conditional is true only in the case of A and C, and that cases of not‐A are irrelevant to its truth or falsity. This result corroborates other theories of conditionals. To resolve the discrepancy, we devised two new tasks: (...) the “collective” truth task, in which participants judged whether sets of assertions about a specific individual, such as: If A then C, not‐A, C, could all be true at the same time; and one in which participants judged the truth of conditional predictions about specific future events. The results consistently matched the three possibilities, thereby corroborating the model theory. They also showed a massive violation of the probability calculus in estimates of the probabilities of the four cases in the partition of conditionals (A and C, A and not‐C, not‐A and C, and not‐A and not‐C), which summed to over 200%. (shrink)

ABSTRACTThe new paradigm in the psychology of reasoning redirects the investigation of deduction conceptually and methodologically because the premises and the conclusion of the inferences are assumed to be uncertain. A probabilistic counterpart of the concept of logical validity and a method to assess whether individuals comply with it must be defined. Conceptually, we used de Finetti's coherence as a normative framework to assess individuals' performance. Methodologically, we presented inference schemas whose premises had various levels of probability that contained non-numerical (...) expressions and, as a control, sure levels. Depending on the inference schemas, from 60% to 80% of the participants produced coherent conclusions when the premises were uncertain. The data also show that except for schemas involving conjunction, performance was consistently lower with certain than uncertain premises, the rate of conjunction fallacy was consistently low (not exceeding 20%,.. (shrink)

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)

Conventional wisdom has it that many intriguing features of indicative conditionals aren’t shared by subjunctive conditionals. Subjunctive morphology is common in discussions of wishes and wants, however, and conditionals are commonly used in such discussions as well. As a result such discussions are a good place to look for subjunctive conditionals that exhibit features usually associated with indicatives alone. Here I offer subjunctive versions of J. L. Austin’s ‘biscuit’ conditionals—e.g., “There are biscuits on the sideboard if you want them”—and subjunctive (...) versions of Allan Gibbard’s ‘stand-off’ or ‘Sly Pete’ conditionals, in which speakers with no relevant false beliefs can in the same context felicitously assert conditionals with the same antecedents and contradictory consequents. My cases undercut views according to which the indicative/subjunctive divide marks a great difference in the meaning of conditionals. They also make trouble for treatments of indicative conditionals that cannot readily be generalized to subjunctives. (shrink)

ABSTRACTTo build a process model of the understanding of conditionals we extract a common core of three semantics of if-then sentences: the conditional event interpretation in the coherencebased probability logic, the discourse processingtheory of Hans Kamp, and the game-theoretical approach of Jaakko Hintikka. The empirical part reports three experiments in which each participant assessed the probability of 52 if-then sentencesin a truth table task. Each experiment included a second task: An n-back task relating the interpretation of conditionals to working memory, (...) a Bayesian bookbag and poker chip task relating the interpretation of conditionals to probability updating, and a probabilistic modus ponens task relating the interpretation of conditionals to a classical inference task. Data analysis shows that the way in which the conditionals are interpreted correlates with each of the supplementary tasks. The results are discussed within the process model proposed in the introduction. (shrink)

In Part I of this paper, we identified and compared various schemes for trivalent truth conditions for indicative conditionals, most notably the proposals by de Finetti and Reichenbach on the one hand, and by Cooper and Cantwell on the other. Here we provide the proof theory for the resulting logics DF/TT and CC/TT, using tableau calculi and sequent calculi, and proving soundness and completeness results. Then we turn to the algebraic semantics, where both logics have substantive limitations: DF/TT allows for (...) algebraic completeness, but not for the construction of a canonical model, while CC/TT fails the construction of a Lindenbaum-Tarski algebra. With these results in mind, we draw up the balance and sketch future research projects. (shrink)

Less‐than‐certain conditional judgments pose notorious problems for strict analyses of conditionals: across their various incarnations, these analyses have trouble making sense of how conditionals could have non‐trivial probabilities in the first place; minimal constraints on how such probabilities are to be assigned, moreover, lead to results that seem at odds with a strict outlook on the semantics of conditionals, most notably the validity of Conditional Excluded Middle. I demonstrate that a strict analysis can overcome the trouble if couched in a (...) bilateral dynamic setting that properly extends the familiar Ramsey test for accepting conditionals to other iffy attitudes, most importantly the one of rejecting a conditional. The resulting framework accommodates the appeal of Stalnaker's thesis as well as of Conditional Excluded Middle in a strict setting. A discussion of how to handle the probability of epistemically modalized conditionals and of compounds of conditionals is provided. (shrink)

Let us call a statement of the form ‘If A was, is, or will be the case, then C was, is, or will be the case’ an indicative conditional. And let us call a statement of the form ‘If A had been, were, or were to be the case, then C would have been, would be, or would come to be the case’ a subjunctive, or counterfactual, conditional.

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)

Causal reasoning is one of our most central cognitive competencies, enabling us to adapt to our world. Causal knowledge allows us to predict future events, or diagnose the causes of observed facts. We plan actions and solve problems using knowledge about cause-effect relations. Without our ability to discover and empirically test causal theories, we would not have made progress in various empirical sciences. In the past decades, the important role of causal knowledge has been discovered in many areas of cognitive (...) psychology. Despite the ubiquity of causal reasoning, textbooks of cognitive psychology have neglected this growing field. The goal of The Oxford Handbook of Causal Reasoning is to fill this gap. The handbook brings together the leading researchers in the field of causal reasoning and offers state-of-the-art presentations of theories and research. It provides introductions of competing theories of causal reasoning, and discusses its role in various cognitive functions and domains. The final section presents research from neighboring fields. 1. Causal Reasoning: An Introduction Michael R. Waldmann Part I: Theories of Causal Cognition 2. Associative Accounts of Causal Cognition Mike E. Le Pelley, Oren Griffiths, and Tom Beesley 3. Rules of Causal Judgment: Mapping Statistical Information Onto Causal Beliefs José C. Perales, Andrés Catena, Antonio Cándido, and Antonio Maldonado 4. The Inferential Reasoning Theory of Causal Learning: Toward a Multi- Process Propositional Account Yannick Boddez, Jan De Houwer, and Tom Beckers 5. Causal Invariance as an Essential Constraint for Creating a Causal Representation of the World: Generalizing the Invariance of Causal Power Patricia W. Cheng and Hongjing Lu 6. The Acquisition and Use of Causal Structure Knowledge Benjamin Margolin Rottman 7. Formalizing Prior Knowledge in Causal Induction Thomas L. Griffiths 8. Causal Mechanisms Samuel G. B. Johnson and Woo-kyoung Ahn 9. Force Dynamics and Causation Phillip Wolff and Robert Thorstad 10. Mental Models and Causation P. N. Johnson- Laird and Sangeet S. Khemlani 11. Pseudocontingencies Klaus Fiedler and Florian Kutzner 12. Singular Causation David Danks 13. Cognitive Neuroscience of Causal Reasoning Joachim T. Operskalski and Aron K. Barbey Part II: Basic Cognitive Functions 14. Visual Impressions of Causality Peter White 15. Goal-Directed Actions Bernhard Hommel 16. Planning and Control Magda Osman 17. Reinforcement Learning and Causal Models Samuel J. Gershman 18. Causation and the Probability of Causal Conditionals David E. Over 19. Causal Models and Conditional Reasoning Mike Oaksford and Nick Chater 20. Concepts as Causal Models: Categorization Bob Rehder 21. Concepts as Causal Models: Induction Bob Rehder 22. Causal Explanation Tania Lombrozo and Nadya Vasilyeva 23. Diagnostic Reasoning Björn Meder and Ralf Mayrhofer 24. Inferring Causal Relations by Analogy Keith J. Holyoak and Hee-Seung Lee 25. Causal Argument Ulrike Hahn, Roland Bluhm, and Frank Zenker 26. Causality in Decision- Making York Hagmayer and Philip M. Fernbach Part III: Domains of Causal Reasoning 27. Intuitive Theories Tobias Gerstenberg and Joshua B. Tenenbaum 28. Space, Time, and Causality Marc J. Buehner 29. Causation in Legal and Moral Reasoning David A. Lagnado and Tobias Gerstenberg 30. The Role of Causal Knowledge in Reasoning About Mental Disorders Woo-kyoung Ahn, Nancy S. Kim, and Matthew S. Lebowitz 31. Causality and Causal Reasoning in Natural Language Torgrim Solstad and Oliver Bott 32. Social Attribution and Explanation Denis Hilton Part IV: Development, Phylogeny, and Culture 33. The Development of Causal Reasoning Paul Muentener and Elizabeth Bonawitz 34. Causal Reasoning in Non-Human Animals Christian Schloegl and Julia Fischer 35. Causal Cognition and Culture Andrea Bender, Sieghard Beller, and Douglas L. Medin. (shrink)

In this paper, a novel experimental task is developed for testing the highly influential, but experimentally underexplored, possible worlds account of conditionals (Stalnaker, 1968; Lewis, 1973). In Experiment 1, this new task is used to test both indicative and subjunctive conditionals. For indicative conditionals, five competing truth tables are compared, including the previously untested, multi-dimensional possible worlds semantics of Bradley (2012). In Experiment 2, these results are replicated and it is shown that they cannot be accounted for by an alternative (...) hypothesis proposed by our reviewers. In Experiment 3, individual variation in truth assignments of indicative conditionals is investigated via Bayesian mixture models that classify participants as following one of several competing models. As a novelty of this study, it is found that a possible worlds semantics of Lewis and Stalnaker is capable of accounting for participants’ aggregate truth value assignments in this task. Applied to indicative conditionals, we show across three experiments, that the theory both captures participants’ truth values at the aggregate level (Experiments 1 and 2) and that it makes up the largest subgroup in the analysis of individual variation in our experimental paradigm (Experiment 3). (shrink)

Habilitation thesis in psychology. The book consists of a collection of reasoning studies. The experimental investigations will take us from people’s reasoning about probabilities, entailments, pragmatic factors, argumentation, and causality to morality. An overarching theme of the book is norm pluralism and individual differences in rationality research.

Introduction to 'Belief and Probability,' issue of Philosophical Studies, January 1995. Remarks on contents, including van Fraassen, 'Belief and the Problem of Ulysses and the Sirens,' Skyrms, 'Strict Coherence, Sigma Coherence and the Metaphysics of Quantity,' Jeffrey, 'Probability Reparation,' de Finetti, 'The Logic of Probability,' Kolmogorov, 'Complete Metric Boolean Algebras,' 4 more.

ABSTRACTThree experiments examined how people reason about what is possible or necessary when a conditional is true. Participants were asked to indicate whether it was necessary, possible or impossible for a specific instance to conform to one of the truth-table cases, given the truth of the conditional. It was found that most participants, inconsistently, judged the pq case as necessary but the ¬pq or ¬p¬q cases as possible. Logically, these two kinds of judgments are contradictory. Moreover, a true conditional doesn’t (...) imply that a specific instance under the conditional must be pq. Therefore, people demonstrate a necessity illusion for pq cases which contradicts their commitment to the possibility of ¬pq or ¬p¬q cases. Existing accounts of conditionals are unable to explain the contradiction and the necessity illusion. We propose an inference dissociation account and explore the theoretical implications of this necessity illusion. (shrink)

In the paper, we provide a general formalism for computing probabilities of indicative conditionals. Our model is based on the idea of constructing a (labeled) Markov graph G(α), which models the sentence α, containing an arbitrarily complex conditional (exhibiting in particular its structure). The formalism makes computing these probabilities an easy task—it consists of solving simple systems of linear equations. The graph G(α) generates a canonical probability space S(α) = (Ωα, Σα, Pα), where α is given an interpretation as an (...) event so that the probability can be computed mathematically. We present a general inductive definition of the graph G(α) for a sentence α of arbitrary complexity. It is based on the idea of defining graph-building operations which correspond to the negation and conjunction and the non-Boolean conditional connective →. The definition enables the construction of graphs and the corresponding systems of equations for arbitrarily complex conditionals in an algorithmic and efficient manner. (shrink)