We argue that logical semantics might have faltered due to its failure in distinguishing between two fundamentally very different types of concepts: ontological concepts, that should be types in a strongly-typed ontology, and logical concepts, that are predicates corresponding to properties of and relations between objects of various ontological types. We will then show that accounting for these differences amounts to the integration of lexical and compositional semantics in one coherent framework, and to an embedding in our logical semantics of (...) a strongly-typed ontology that reflects our commonsense view of the world and the way we talk about it in ordinary language. We will show that in such a framework a number of challenges in natural language semantics can be adequately and systematically treated. (shrink)

The canonical Bayesian solution to the ravens paradox faces a problem: it entails that black non-ravens disconfirm the hypothesis that all ravens are black. I provide a new solution that avoids this problem. On my solution, black ravens confirm that all ravens are black, while non-black non-ravens and black non-ravens are neutral. My approach is grounded in certain relations of epistemic dependence, which, in turn, are grounded in the fact that the kind raven is more natural than the kind black. (...) The solution applies to any generalization “All F’s are G” in which F is more natural than G. (shrink)

To clarify and illuminate the place of probability in science Ellery Eells and James H. Fetzer have brought together some of the most distinguished philosophers ...

In From Instrumentalism to Constructive Realism Theo Kuipers presents a theory of qualitative confirmation that is supposed to not assume the existence of quantitative probabilities. He claims that this theory is able to resolve some paradoxes in confirmation theory, including the ravens paradox. This paper shows that there are flaws in Kuipers' qualitative confirmation theory and in his application of it to the ravens paradox.

Bayes' Theorem is a simple mathematical formula used for calculating conditional probabilities. It figures prominently in subjectivist or Bayesian approaches to epistemology, statistics, and inductive logic. Subjectivists, who maintain that rational belief is governed by the laws of probability, lean heavily on conditional probabilities in their theories of evidence and their models of empirical learning. Bayes' Theorem is central to these enterprises both because it simplifies the calculation of conditional probabilities and because it clarifies significant features of subjectivist position. Indeed, (...) the Theorem's central insight — that a hypothesis is confirmed by any body of data that its truth renders probable — is the cornerstone of all subjectivist methodology. (shrink)

According to Hempel's paradox, evidence (E) that an object is a nonblack nonraven confirms the hypothesis (H) that every raven is black. According to the standard Bayesian solution, E does confirm H but only to a minute degree. This solution relies on the almost never explicitly defended assumption that the probability of H should not be affected by evidence that an object is nonblack. I argue that this assumption is implausible, and I propose a way out for Bayesians. Introduction Hempel's (...) paradox, the standard Bayesian solution, and the disputed assumption Attempts to defend the disputed assumption Attempts to refute the disputed assumption A way out for Bayesians Conclusion. (shrink)

Disputes between advocates of Bayesians and more orthodox approaches to statistical inference presuppose that Bayesians must regard must regard stopping rules, which play an important role in orthodox statistical methods, as evidentially irrelevant.In this essay, I show that this is not the case and that the stopping rule is evidentially relevant given some Bayesian confirmation measures that have been seriously proposed. However, I show that accepting a confirmation measure of this sort comes at the cost of rejecting two useful ancillaryBayesian (...) principles. (shrink)

The Paradox of the Ravens (a.k.a,, The Paradox of Confirmation) is indeed an old chestnut. A great many things have been written and said about this paradox and its implications for the logic of evidential support. The first part of this paper will provide a brief survey of the early history of the paradox. This will include the original formulation of the paradox and the early responses of Hempel, Goodman, and Quine. The second part of the paper will describe attempts (...) to resolve the paradox within a Bayesian framework, and show how to improve upon them. This part begins with a discussion of how probabilistic methods can help to clarify the statement of the paradox itself. And it describes some of the early responses to probabilistic explications. We then inspect the assumptions employed by traditional (canonical) Bayesian approaches to the paradox. These assumptions may appear to be overly strong. So, drawing on weaker assumptions, we formulate a new-and-improved Bayesian confirmation-theoretic resolution of the Paradox of the Ravens. (shrink)

In the Paradox of the Ravens, a set of otherwise intuitive claims about evidence seems to be inconsistent. Most attempts at answering the paradox involve rejecting a member of the set, which seems to require a conflict either with commonsense intuitions or with some of our best confirmation theories. In contrast, I argue that the appearance of an inconsistency is misleading: ‘confirms’ and cognate terms feature a significant ambiguity when applied to universal generalisations. In particular, the claim that some evidence (...) confirms a universal generalisation ordinarily suggests, in part, that the evidence confirms the reliability of predicting that something which satisfies the antecedent will also satisfy the consequent. I distinguish between the familiar relation of confirmation simpliciter and what I shall call ‘predictive confirmation’. I use them to formulate my answer, illustrate it in a very simple probabilistic model, and defend it against objections. I conclude that, once our evidential concepts are sufficiently clarified, there is no sense in which the initial claims are both plausible and inconsistent. (shrink)

I argue that the standard Bayesian solution to the ravens paradox— generally accepted as the most successful solution to the paradox—is insufficiently general. I give an instance of the paradox which is not solved by the standard Bayesian solution. I defend a new, more general solution, which is compatible with the Bayesian account of confirmation. As a solution to the paradox, I argue that the ravens hypothesis ought not to be held equivalent to its contrapositive; more interestingly, I argue that (...) how we formally represent hypotheses ought to vary with the context of inquiry. This explains why the paradox is compelling, while dealing with standard objections to holding hypotheses inequivalent to their contrapositives. (shrink)

Historically, Nelson Goodman’s paradox involving the predicates ‘grue’ and ‘bleen’ has been taken to furnish a serious blow to Carl Hempel’s theory of confirmation in particular and to purely formal theories of confirmation in general. In this paper, I argue that Goodman’s paradox is no more serious of a threat to Hempel’s theory of confirmation than is Hempel’s own paradox of the ravens. I proceed by developing a suggestion from R. D. Rosenkrantz into an argument for the conclusion that these (...) paradoxes are, in fact, equivalent. My argument, if successful, is of both historical and philosophical interest. Goodman himself maintained that Hempel’s theory of confirmation was capable of handling the paradox of the ravens. And Hempel eventually conceded that Goodman’s paradox showed that there could be no adequate, purely syntactical theory of confirmation. The conclusion of my argument entails, by contrast, that Hempel’s theory of confirmation is incapable of handling Goodman’s paradox if and only if it is incapable of handling the paradox of the ravens. It also entails that for any adequate solution to one of these paradoxes, there is a corresponding and equally adequate solution to the other. (shrink)

Showcasing original arguments for well-defined positions, as well as clear and concise statements of sophisticated philosophical views, this volume is an ...

Hempel first introduced the paradox of confirmation in (Hempel 1937). Since then, a very extensive literature on the paradox has evolved (Vranas 2004). Much of this literature can be seen as responding to Hempel’s subsequent discussions and analyses of the paradox in (Hempel 1945). Recently, it was noted that Hempel’s intuitive (and plausible) resolution of the paradox was inconsistent with his official theory of confirmation (Fitelson & Hawthorne 2006). In this article, we will try to explain how this inconsistency affects (...) the historical dialectic about the paradox and how it illuminates the nature of confirmation. In the end, we will argue that Hempel’s intuitions about the paradox of confirmation were (basically) correct, and that it is his theory that should be rejected, in favor of a (broadly) Bayesian account of confirmation. (shrink)

Contemporary Bayesian confirmation theorists measure degree of (incremental) confirmation using a variety of non-equivalent relevance measures. As a result, a great many of the arguments surrounding quantitative Bayesian confirmation theory are implicitly sensitive to choice of measure of confirmation. Such arguments are enthymematic, since they tacitly presuppose that certain relevance measures should be used (for various purposes) rather than other relevance measures that have been proposed and defended in the philosophical literature. I present a survey of this pervasive class of (...) Bayesian confirmation-theoretic enthymemes, and a brief analysis of some recent attempts to resolve the problem of measure sensitivity. (shrink)

Logical Probability (LP) is strictly distinguished from Statistical Probability (SP). To measure semantic information or confirm hypotheses, we need to use sampling distribution (conditional SP function) to test or confirm fuzzy truth function (conditional LP function). The Semantic Information Measure (SIM) proposed is compatible with Shannon’s information theory and Fisher’s likelihood method. It can ensure that the less the LP of a predicate is and the larger the true value of the proposition is, the more information there is. So the (...) SIM can be used as Popper's information criterion for falsification or test. The SIM also allows us to optimize the true-value of counterexamples or degrees of disbelief in a hypothesis to get the optimized degree of belief, i. e. Degree of Confirmation (DOC). To explain confirmation, this paper 1) provides the calculation method of the DOC of universal hypotheses; 2) discusses how to resolve Raven Paradox with new DOC and its increment; 3) derives the DOC of rapid HIV tests: DOC of “+” =1-(1-specificity)/sensitivity, which is similar to Likelihood Ratio (=sensitivity/(1-specificity)) but has the upper limit 1; 4) discusses negative DOC for excessive affirmations, wrong hypotheses, or lies; and 5) discusses the DOC of general hypotheses with GPS as example. (shrink)

The discussion about the Raven Paradox is ever-renewing: after nearly 70 years, many authors propose from time to time new solutions, and many authors state that these solutions are unsatisfactory. It is worthy to be carefully noted that though most arguments in favor or against the paradox are based on the notion of “probability” and on the application of Bayes’ law, not one of them makes use of the Kolmogorov axiomatic theory of probability and on the subsequent notion of “random (...) variable”. This seems to be due to a preference for the purely logical interpretation of the notion of “probability” which makes it possible to assign a probability value to propositions expressing natural (universal) laws. This paper aims at presenting an attempt to contribute a solution to the paradox by the proposal of a different way to express universal natural laws and by the use of a language which does not allow one to apply probability to universal statements. (shrink)

The (recent, Bayesian) cognitive science literature on The Wason Task (WT) has been modeled largely after the (not-so-recent, Bayesian) philosophy of science literature on The Paradox of Confirmation (POC). In this paper, we apply some insights from more recent Bayesian approaches to the (POC) to analogous models of (WT). This involves, first, retracing the history of the (POC), and, then, reexamining the (WT) with these historico-philosophical insights in mind.

This research article revisits Hempel’s logic of confirmation in light of recent developments in categorical proof theory. While Hempel advocated several logical conditions in favor of a purely syntactical definition of a general non-quantitative concept of confirmation, we show how these criteria can be associated to specific logical properties of monoidal modal deductive systems. In addition, we show that many problems in confirmation logic, such as the tacked disjunction, the problem of weakening with background knowledge and the problem of irrelevant (...) conjunction, are also associated with specific logical properties and, incidentally, with some of Hempel’s logical conditions of adequacy. We discuss the raven paradox together with further objections against Hempel’s approach, showing how our analysis enables a clear understanding of the relationships between Hempel’s conditions, the problems in confirmation logic, and the properties of deductive systems. (shrink)

We use recently developed approaches in argumentation theory in order to revamp the hypothetico-deductive model of confirmation, thus alleviating the well-known paradoxes the H-D account faces. More specifically, we introduce the concept of dialectic confirmation on the background of the so-called theory of dialectical structures (Betz 2010, 2012b). Dialectic confirmation generalises hypothetico-deductive confirmation and mitigates the raven paradox, the grue paradox, the tacking paradox, the paradox from conceptual difference, and the problem of surprising evidence.

The likelihood principle (LP) is a core issue in disagreements between Bayesian and frequentist statistical theories. Yet statements of the LP are often ambiguous, while arguments for why a Bayesian must accept it rely upon unexamined implicit premises. I distinguish two propositions associated with the LP, which I label LP1 and LP2. I maintain that there is a compelling Bayesian argument for LP1, based upon strict conditionalization, standard Bayesian decision theory, and a proposition I call the practical relevance principle. In (...) contrast, I argue that there is no similarly compelling argument for or against LP2. I suggest that these conclusions lead to a restrictedly pluralistic view of Bayesian confirmation measures. (shrink)

In the first chapter of his book Logical Foundations of Probability, Rudolf Carnap introduced and endorsed a philosophical methodology which he called the method of ‘explication’. P.F. Strawson took issue with this methodology, but it is currently undergoing a revival. In a series of articles, Patrick Maher has recently argued that explication is an appropriate method for ‘formal epistemology’, has defended it against Strawson’s objection, and has himself put it to work in the philosophy of science in further clarification of (...) the very concepts on which Carnap originally used it (degree of confirmation, and probability), as well as some concepts to which Carnap did not apply it (such as justified degree of belief). We shall outline Carnap’s original idea, plus Maher’s recent application of such a methodology, and then seek to show that the problem Strawson raised for it has not been dealt with. The method is indeed, we argue, problematic and therefore not obviously superior to the ‘descriptive’ method associated with Strawson. Our targets will not only be Carnapians, though, for what we shall say also bears negatively on a project that Paul Horwich has pursued under the name ‘therapeutic’, or ‘Wittgensteinian’ Bayesianism. Finally, explication, as we shall suggest and as Carnap recognised, is not the only route to philosophical enlightenment. (shrink)

It is widely thought that Bayesian confirmation theory has provided a solution to Hempel's Paradox (the Ravens Paradox). I discuss one well‐known example of this approach, by John Mackie, and argue that it is unconvincing. I then suggest an alternative solution, which shows that the Bayesian approach is altogether mistaken. Nicod's Condition should be rejected because a generalisation is not confirmed by any of its instances if it is not law‐like. And even law‐like non‐basic empirical generalisations, which are expressions of (...) assumed underlying causal regularities, are not so confirmed if they are absurd in the light of our causal background knowledge or if their instances are not also possible instances of the relevant causal claim. (shrink)

Rudolf Carnap introduced and endorsed a philosophical methodology which he called the method of ‘explication’. P.F. Strawson took issue with this methodology, but it is currently undergoing a revival. In a series of articles, Patrick Maher has recently argued that explication is an appropriate method for ‘formal epistemology’, has defended it against Strawson’s objection, and has himself put it to work in the philosophy of science in further clarification of the very concepts on which Carnap originally used it (degree of (...) confirmation, and probability), as well as some concepts to which Carnap did not apply it (such as justified degree of belief. We outline Carnap’s original idea, plus Maher’s recent application of such a methodology, and then seek to show that the problem Strawson raised for it has not been dealt with. The method is indeed, we argue, problematic and therefore not obviously superior to the ‘descriptive’ method associated with Strawson. (shrink)

This article discusses the problem of non-zero probabilities for non-tautologous universal generalizations in Rudolf Carnap’s inductive logic when the domain of discourse is infinite. A solution is provided for a generalization of the form “all Xs are Ys”, for example “all ravens all black”. The solution is based on assuming that a significant part of the domain consists of non-Xs. This assumption can often be justified as a kind of ceteris paribus principle.