Iterated conditionals of the form If p, then if q, r are an important topic in philosophical logic. In recent years, psychologists have gained much knowledge about how people understand simple conditionals, but there are virtually no published psychological studies of iterated conditionals. This paper presents experimental evidence from a study comparing the iterated form, If p, then if q, r with the “imported,” noniterated form, If p and q, then r, using a probability evaluation task and a truth‐table task, (...) and taking into account qualitative individual differences. This allows us to critically contrast philosophical and psychological approaches that make diverging predictions regarding the interpretation of these forms. The results strongly support the probabilistic Adams conditional and the “new paradigm” that takes this conditional as a starting point. (shrink)

Conditional learning, where agents learn a conditional sentence ‘If A, then B,’ is difficult to incorporate into existing Bayesian models of learning. This is because conditional learning is not uniform: in some cases, learning a conditional requires decreasing the probability of the antecedent, while in other cases, the antecedent probability stays constant or increases. I argue that how one learns a conditional depends on the causal structure relating the antecedent and the consequent, leading to a causal model of conditional learning. (...) This model extends traditional Bayesian learning by incorporating causal models into agents’ epistemic states. On this theory, conditional learning proceeds in two steps. First, an agent learns a new causal model with the appropriate relationship between the antecedent and the consequent. Then, the agent narrows down the set of possible worlds to include only those which make the conditional proposition true. This model of learning can incorporate both standard cases of Bayesian learning and the non-uniform learning required to learn conditional information. (shrink)

Truth-value gaps have received little attention from a foundational perspective, a fact which has rightfully opened up gap theories to charges of vacuousness. This paper develops an account of the foundations of gap-like behavior which has some hope of avoiding such charges. I begin by reviewing and sharpening a powerful argument of Dummett’s to constrain the options that gap theorists have to make sense of their views. I then show that within these strictures, we can give an account of gaps (...) by drawing on elements of a broadly Stalnakerian framework for assertion and using gaps to track an amalgamation of assertoric effects. The discussion reveals that we may need special resources in our theories of assertion to posit gaps, that gaps may be unusable in characterizing the structure of mental states, and that gaps may have heterogeneous linguistic sources that result in equally heterogeneous projective and inferential behavior. (shrink)

Yablo’s Aboutness introduces powerful new set of tools for analyzing meaning. I compare his account of subject matter to the related ideas employed in the semantics literature on questions and focus. I then discuss two applications of subject matter: to presupposition triggering and to ascriptions of shared content.

ABSTRACT A trivalent theory of indicative conditionals automatically enforces Stalnaker's thesis – the equation between probabilities of conditionals and conditional probabilities. This result holds because the trivalent semantics requires, for principled reasons, a modification of the ratio definition of conditional probability in order to accommodate the possibility of undefinedness. I explain how this modification is motivated and how it allows the trivalent semantics to avoid a number of well-known triviality results, in the process clarifying why these results hold for many (...) bivalent theories. In short, the slew of triviality results published in the last 40-odd years need not be viewed as an argument against Stalnaker's thesis: it can be construed instead as an argument for abandoning the bivalent requirement that indicative conditionals somehow be assigned a truth-value in worlds in which their antecedents are false. (shrink)

Thought: A Journal of Philosophy, Volume 10, Issue 1, Page 42-52, March 2021.

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)

Disjunctive antecedent conditionals —conditionals of the form if A or B, C—sometimes seem to entail both of their simplifications and sometimes seem not to. I argue that this behavior reveals a genuine ambiguity in DACs. Along the way, I discuss a new observation about the role of focal stress in distinguishing the two interpretations of DACs. I propose a new theory, according to which the surface form of a DAC underdetermines its logical form: on one possible logical form, if A (...) or B, C does entail both of its simplifications, while on the other, it does not. (shrink)

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.

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

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)

The problem of probabilities of conditionals is one of the long-standing puzzles in philosophy of language. We defend and update Adams' solution to the puzzle: the probability of an epistemic conditional is not the probability of a proposition, but a probability under a supposition. -/- Close inspection of how a triviality result unfolds in a concrete scenario does not provide counterexamples to the view that probabilities of conditionals are conditional probabilities: instead, it supports the conclusion that probabilities of conditionals violate (...) standard probability theory. -/- This does not call into question probability theory per se; rather, it calls for a more careful understanding of its role: probability theory is a theory of probabilities of propositions; but as conditionals do not express propositions, their probabilities are not subject to the standard laws. -/- We argue that both conditional probabilities and probabilities of conditionals are best understood in terms of the dynamics of supposing, modeled as a restriction operation on a probability space. This version of the suppositionalist view allows us to connect Adams' Thesis to the widely held restrictor view of the semantics of conditionals. -/- We address two common objections to Adams' view: that the relevant probabilities are ‘probabilities only in name’, and that giving up conditional propositions puts us at a disadvantage when it comes to interpreting compounds. -/- Finally, we argue that some putative counterexamples to Adams' Thesis can be diagnosed as fallacies of probabilistic reasoning: they arise from applying to conditionals laws of standard probability theory which are invalid for them. (shrink)

This paper clarifies the relationship between the Triviality Results for the conditional and the Restrictor Theory of the conditional. On the understanding of Triviality proposed here, it is implausible—pace many proponents of the Restrictor Theory—that Triviality rests on a syntactic error. As argued here, Triviality arises from simply mistaking the feature a claim has when that claim is logically unacceptable for the feature a claim has when that claim is unsatisfiable. Triviality rests on a semantic confusion—one which some semantic theories, (...) but not others, are prone to making. On the interpretation proposed here, Triviality Results thus play a theoretically constructive role in the project of natural language semantics. (shrink)

Philosophy and Phenomenological Research, EarlyView.

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)

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)

This paper develops a trivalent semantics for indicative conditionals and extends it to a probabilistic theory of valid inference and inductive learning with conditionals. On this account, (i) all complex conditionals can be rephrased as simple conditionals, connecting our account to Adams's theory of p-valid inference; (ii) we obtain Stalnaker's Thesis as a theorem while avoiding the well-known triviality results; (iii) we generalize Bayesian conditionalization to an updating principle for conditional sentences. The final result is a unified semantic and probabilistic (...) theory of conditionals with attractive results and predictions. (shrink)

entry for the Entry for the Stanford Encyclopedia of Philosophy, 2007.

Conditional probability is often used to represent the probability of the conditional. However, triviality results suggest that the thesis that the probability of the conditional always equals conditional probability leads to untenable conclusions. In this paper, I offer an interpretation of this thesis in a possible worlds framework, arguing that the triviality results make assumptions at odds with the use of conditional probability. I argue that these assumptions come from a theory called the operator theory and that the rival restrictor (...) theory can avoid these problematic assumptions. In doing so, I argue that recent extensions of the triviality arguments to restrictor conditionals fail, making assumptions which are only justified on the operator theory. (shrink)