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)

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)

We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular (...) we examine the Fréchet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction Cn+1 of n + 1 conditional events to the family {Cn,En+1|Hn+1}. We consider the relation with the notion of quasi-conjunction and we examine in detail the coherence of the prevision assessments related with the conjunction of three conditional events. Based on conjunction, we also give a characterization of p-consistency and of p-entailment, with applications to several inference rules in probabilistic nonmonotonic reasoning. Finally, we examine some non p-valid inference rules; then, we illustrate by an example two methods which allow to suitably modify non p-valid inference rules in order to get inferences which are p-valid. (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)

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)

The Identity principle says that conditionals with the form 'If p, then p' are logical truths. Identity is overwhelmingly plausible, and has rarely been explicitly challenged. But a wide range of conditionals nonetheless invalidate it. I explain the problem, and argue that the culprit is the principle known as Import-Export, which we must thus reject. I then explore how we can reject Import-Export in a way that still makes sense of the intuitions that support it, arguing that the differences between (...) indicative and subjunctive conditionals play a key role in solving this puzzle. (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)

This work explores the hypothesis that natural language is a tool for changing a language user's state of mind and, more specifically, the hypothesis that a sentence's meaning is constituted by its characteristic role in fulfilling this purpose. This view contrasts with the dominant approach to semantics due to Frege, Tarski and others' work on artificial languages: language is first and foremost a tool for representing the world. Adapted to natural language by Davidson, Lewis, Montague, et. al. this dominant approach (...) has crystalized as truth-conditional semantics: to know the meaning of a sentence is to know the conditions under which that sentence is true. Chapter 1 details the animating ideas of my alternative approach and shows that the representational function of language can be understood in terms of the more general function of changing representational mental states. Chapters 2-4 argue that the additional resources of this more general conception of meaning allow us to explain certain phenomena involving conditionals and grammatical mood that truth-conditional semantics does not. In the analysis of these specific phenomena and the articulation of the general approach on offer, it emerges that this approach combines insights and benefits from both use-theoretic and truth-theoretic work on meaning. (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)

Leibniz seems to have been the first to suggest a logical interpretation of probability, but there have always seemed formidable mathematical and interpretational barriers to implementing the idea. De Finetti revived it only, it seemed, to reject it in favour of a purely decision-theoretic approach. In this paper I argue that not only is it possible to view (Bayesian) probability as a continuum-valued logic, but that it has a very close formal kinship with classical propositional logic.

In this paper I argue that de Finetti provided compelling reasons for rejecting countable additivity. It is ironical therefore that the main argument advanced by Bayesians against following his recommendation is based on the consistency criterion, coherence, he himself developed. I will show that this argument is mistaken. Nevertheless, there remain some counter-intuitive consequences of rejecting countable additivity, and one in particular has all the appearances of a full-blown paradox. I will end by arguing that in fact it is no (...) paradox, and that what it shows is that conditionalisation, often claimed to be integral to the Bayesian canon, has to be rejected as a general rule in a finitely additive environment. (shrink)

There is a new Bayesian, or probabilistic, paradigm in the psychology of reasoning, with new psychological accounts of the indicative conditional of natural language. In psychological experiments in this new paradigm, people judge that the probability of the indicative conditional, P(if A then C), is the conditional probability of C given A, P(C | A). In other experiments, participants respond with what has been called the 'de- fective' truth table: they judge that if A then C is true when A (...) holds and C holds, is false when A holds and C does not, and is neither true nor false when A does not hold. We argue that these responses are not 'defective' in any negative sense, as many psychologists have implied. We point out that a number of normative researchers, including de Finetti, have proposed such a table for various coherent interpretations of the third value. We review the relevant general tables in the normative literature, in which there is a third value for A and C and the logically compound forms of the natural language conditional, negation, conjunction, disjunction, and the material conditional. We describe the results of an experiment on which of these tables best describes ordinary people's judgements when the third value is interpreted as indicating uncertainty. (shrink)

A study is reported testing two hypotheses about a close parallel relation between indicative conditionals, if A then B , and conditional bets, I bet you that if A then B . The first is that both the indicative conditional and the conditional bet are related to the conditional probability, P(B|A). The second is that de Finetti's three-valued truth table has psychological reality for both types of conditional— true , false , or void for indicative conditionals and win , lose (...) , or void for conditional bets. The participants were presented with an array of chips in two different colours and two different shapes, and an indicative conditional or a conditional bet about a random chip. They had to make judgements in two conditions: either about the chances of making the indicative conditional true or false or about the chances of winning or losing the conditional bet. The observed distributions of responses in the two conditions were generally related to the conditional probability, supporting the first hypothesis. In addition, a majority of participants in further conditions chose the third option, “void”, when the antecedent of the conditional was false, supporting the second hypothesis. (shrink)

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 note relates the Lewis/Kratzer view of conditionals as restrictors to the philosophical debate over the meaning of conditionals.

In studies of scientific methodology, surprisingly little attention has been given to tests of hypotheses. Such testing constitutes a methodology common to various scientific disciplines and is an essential factor in the development of science since it determines which theories are retained. The classical theory of tests is a major accomplishment but requires modification in order to produce a theory that accounts for the success of science. The revised theory is an analysis of the nondeductive aspect of scientific reasoning. It (...) results in a new definition of probability and a nonclassical point of view with regard to the foundations of probability. (shrink)

This article begins by outlining some of the history—beginning with brief remarks of Quine's—of work on conditional assertions and conditional events. The upshot of the historical narrative is that diverse works from various starting points have circled around a nexus of ideas without convincingly tying them together. Section 3 shows how ideas contained in a neglected article of de Finetti's lead to a unified treatment of the topics based on the identification of conditional events as the objects of conditional bets. (...) The penultimate section explores some of the consequences of the resulting logic of conditional events while the last defends it. (shrink)

Known as an upholder of subjectivism, Bruno de finetti (1906-1985) put forward a totally original philosophy of probability. This can be qualified as a combination of empiricism and pragmatism within an entirely coherent antirealistic perspective. The paper aims at clarifying the central features of such a philosophical position, Which is not only incompatible with any perspective based on an objective notion, But cannot be assimilated to other subjective views of probability either.

The sum, difference, product and quotient of two functions with different domains are usually defined only on their common domain. This paper extends these definitions so that the sum and other operations are essentially defined anywhere that at least one of the components is defined. This idea is applied to propositions and events, expressed as indicator functions, to define conditional propositions and conditional events as three-valued indicator functions that are undefined when their condition is false. Extended operations of "and", "or", (...) "not" and "conditioning" are then defined on these conditional events with variable conditions. The probabilities of the disjunction and of the conjunction of two conditionals are expressed in terms of the conditional probabilities of the component conditionals. In a special case, these are shown to be weighted averages of the component conditional probabilities where the weights are the relative probabilities of the various conditions. Next, conditional random variables are defined to be random variables X whose domain has been restricted by a condition on a second random variable Y. The extended sum, difference, product and conditioning operations on functions are then applied to these conditional random variables. The expectation of a random variable and the conditional expectation of a conditional random variable are recounted. Theorem 1 generalizes the standard result that the conditional expectation of the sum of two conditional random variables with disjoint and exhaustive conditions is a weighted sum of the conditional expectations of the component conditional random variables. Because of the extended operations, the theorem is true for arbitrary conditions. Theorem 2 gives a formula for the expectation of the product of two conditional random variables. After the definition of independence of two random variables is extended to accommodate the extended operations, it is applied to the formula of Theorem 2 to simplify the expectation of a product of conditional random variables. Two examples end the paper. The first concerns a work force of n workers of different output levels and work shifts. The second example involves two radars with overlapping surveillance regions and different detection error rates. One radar's error rate is assumed to be sensitive to fog and the other radar's error rate is assumed to be sensitive to air traffic density. The combined error rate over the combined surveillance region given heavy fog and moderate air traffic is computed. (shrink)

Many people believe that there is a Dutch Book argument establishing that the principle of countable additivity is a condition of coherence. De Finetti himself did not, but for reasons that are at first sight perplexing. I show that he rejected countable additivity, and hence the Dutch Book argument for it, because countable additivity conflicted with intuitive principles about the scope of authentic consistency constraints. These he often claimed were logical in nature, but he never attempted to relate this idea (...) to deductive logic and its own concept of consistency. This I do, showing that at one level the definitions of deductive and probabilistic consistency are identical, differing only in the nature of the constraints imposed. In the probabilistic case I believe that R.T. Cox's ‘scale-free’ axioms for subjective probability are the most suitable candidates. 1 Introduction 2 Coherence and Consistency 3 The Infinite Fair Lottery 4 The Puzzle Resolved—But Replaced by Another 5 Countable Additivity, Conglomerability and Dutch Books 6 The Probability Axioms and Cox's Theorem 7 Truth and Probability 8 Conclusion: ‘Logical Omniscience’ CiteULike Connotea Del.icio.us What's this? (shrink)

This paper uses a non-distributive system of Boolean fractions (a|b), where a and b are 2-valued propositions or events, to express uncertain conditional propositions and conditional events. These Boolean fractions, 'a if b' or 'a given b', ordered pairs of events, which did not exist for the founders of quantum logic, can better represent uncertain conditional information just as integer fractions can better represent partial distances on a number line. Since the indeterminacy of some pairs of quantum events is due (...) to the mutual inconsistency of their experimental conditions, this algebra of conditionals can express indeterminacy. In fact, this system is able to express the crucial quantum concepts of orthogonality, simultaneous verifiability, compatibility, and the superposition of quantum events, all without resorting to Hilbert space. A conditional (a|b) is said to be "inapplicable" (or "undefined") in those instances or models for which b is false. Otherwise the conditional takes the truth-value of proposition a. Thus the system is technically 3-valued, but the 3rd value has nothing to do with a state of ignorance, nor to some half-truth. People already routinely put statements into three categories: true, false, or inapplicable. As such, this system applies to macroscopic as well as microscopic events. Two conditional propositions turn out to be simultaneously verifiable just in case the truth of one implies the applicability of the other. Furthermore, two conditional propositions (a|b) and (c|d) reside in a common Boolean sub-algebra of the non-distributive system of conditional propositions just in case b = d, their conditions are equivalent. Since all aspects of quantum mechanics can be represented with this near classical logic, there is no need to adopt Hilbert space logic as ordinary logic, just a need perhaps to adopt propositional fractions to do logic, just as we long ago adopted integer fractions to do arithmetic. The algebra of Boolean fractions is a natural, near-Boolean extension of Boolean algebra adequate to express quantum logic. While this paper explains one group of quantum anomalies, it nevertheless leaves no less mysterious the 'influence-at-a-distance', quantum entanglement phenomena. A quantum realist must still embrace non-local influences to hold that "hidden variables" are the measured properties of particles. But that seems easier than imaging wave-particle duality and instant collapse, as offered by proponents of the standard interpretation of quantum mechanics. (shrink)

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)

(2014). Capturing the relationship between conditionals and conditional probability with a trivalent semantics. Journal of Applied Non-Classical Logics: Vol. 24, Three-Valued Logics and their Applications, pp. 144-152. doi: 10.1080/11663081.2014.911535.

According to Adams, the acceptability of an indicative conditional goes with the conditional probability of the consequent given the antecedent. However, some conditionals seem to be inappropriate, although their corresponding conditional probability is high. These are cases with a missing link between antecedent and consequent. Other conditionals are appropriate even though the conditional probability is low. Finally, we have the so-called biscuit conditionals. In this paper we will generalize analyses of Douven and others to account for the appropriateness of conditionals (...) in terms of evidential support. Our generalization involves making use of Value, or intensity. We will show how this generalization helps to account for biscuit conditionals and conditional threats and promises. Finally, a link is established between this analysis of conditionals and an analysis of generic sentences. (shrink)

Uncertainty and vagueness/imprecision are not the same: one can be certain about events described using vague predicates and about imprecisely specified events, just as one can be uncertain about precisely specified events. Exactly because of this, a question arises about how one ought to assign probabilities to imprecisely specified events in the case when no possible available evidence will eradicate the imprecision (because, say, of the limits of accuracy of a measuring device). Modelling imprecision by rough sets over an approximation (...) space presents an especially tractable case to help get one’s bearings. Two solutions present themselves: the first takes as upper and lower probabilities of the event X the (exact) probabilities assigned X ’s upper and lower rough-set approximations; the second, motivated both by formal considerations and by a simple betting argument, is to treat X ’s rough-set approximation as a conditional event and assign to it a point-valued (conditional) probability. (shrink)

This article focuses on defective conditionals ? namely indicative conditionals whose antecedents are false and whose truth-values therefore cannot be determined. The problem is to decide which formal connective can adequately represent this usage. Classical logic renders defective conditionals true whereas traditional mathematics dismisses them as irrelevant. This difference in treatment entails that, at the propositional level, classical logic validates some sentences that are intuitively false in plane geometry. With two proofs, I show that the same flaw is shared by (...) a family of trivalent logics. I go on to examine the strict conditional and its derivatives. This family is the only one to avoid the faulty inference but it does so without addressing the status of the truth-value assigned to defective conditionals. (shrink)