Over the years several non-equivalent probabilistic measures of coherence have been discussed in the philosophical literature. In this paper we examine these measures with respect to their empirical adequacy. Using test cases from the coherence literature as vignettes for psychological experiments we investigate whether the measures can predict the subjective coherence assessments of the participants. It turns out that the participants’ coherence assessments are best described by Roche’s coherence measure based on Douven and Meijs’ average mutual (...) support approach and the conditional probability. (shrink)

This note makes a contribution to the issue raised in a paper by Popper and Miller (1983) in which it was claimed that probabilistic support is purely deductive. Developing R. C. Jeffrey's remarks, a new general approach to the crucial concept of "going beyond" is here proposed. By means of it a quantitative measure of the inductive component of a probabilistic inference is reached. This proposal leads to vindicating the view that typical predictive probabilistic inferences by (...) enumeration and analogy are purely inductive. (shrink)

The debate on probabilistic measures of coherence flourishes for about 15 years now. Initiated by papers that have been published around the turn of the millennium, many different proposals have since then been put forward. This contribution is partly devoted to a reassessment of extant coherence measures. Focusing on a small number of reasonable adequacy constraints I show that (i) there can be no coherence measure that satisfies all constraints, and that (ii) subsets of these adequacy constraints (...) motivate two different classes of coherence measures. These classes do not coincide with the common distinction between coherence as mutual support and coherence as relative set-theoretic overlap. Finally, I put forward arguments to the effect that for each such class of coherence measures there is an outstanding measure that outperforms all other extant proposals. One of these measures has recently been put forward in the literature, while the other one is based on a novel probabilistic measure of confirmation. (shrink)

Tomoji Shogenji is generally assumed to be the first author to have presented a probabilistic measure of coherence. Interestingly, Rudolf Carnap in his Logical Foundations of Probability discussed a function that is based on the very same idea, namely his well-known relevance measure. This function is largely neglected in the coherence literature because it has been proposed as a measure of evidential support and still is widely conceived as such. The aim of this paper is therefore to investigate (...) Carnap’s measure regarding its plausibility as a candidate for a probabilistic measure of coherence by comparing it to Shogenji’s. It turns out that both measures satisfy and violate the same adequacy constraints, despite not being ordinally equivalent exhibit a strong correlation with each other in a Monte Carlo simulation and perform similarly in a series of test cases for probabilistic coherence measures. (shrink)

Coherence is a property of propositions hanging together or dovetailing with each other. About two decades ago, formal epistemologists started to engage in the project of explicating the seemingly elusive concept of coherence by means of probability theory. Since then, a plethora of coherence measures have been discussed in the literature. In this paper, we propose a general framework for coherence measures that encompasses the different frameworks of deviation measures, overlap measures and mutual support (...) class='Hi'>measures of coherence. Above that we show that some of the new measures that can be obtained outperform existing coherence measures in important respects. (shrink)

Epistemologists and philosophers of science have often attempted to express formally the impact of a piece of evidence on the credibility of a hypothesis. In this paper we will focus on the Bayesian approach to evidential support. We will propose a new formal treatment of the notion of degree of confirmation and we will argue that it overcomes some limitations of the currently available approaches on two grounds: (i) a theoretical analysis of the confirmation relation seen as an extension (...) of logical deduction and (ii) an empirical comparison of competing measures in an experimental inquiry concerning inductive reasoning in a probabilistic setting. (shrink)

According to influential accounts of scientific method, e.g., critical rationalism, scientific knowledge grows by repeatedly testing our best hypotheses. In comparison to rivaling accounts of scientific reasoning such as Bayesianism, these accounts are closer to crucial aspects of scientific practice. But despite the preeminence of hypothesis tests in statistical inference, their philosophical foundations are shaky. In particular, the interpretation of "insignificant results"---outcomes where the tested hypothesis has survived the test---poses a major epistemic challenge that is not sufficiently addressed by the (...) standard methodology for conducting such tests. In this paper, I argue that a quantitative explication of degree of corroboration can fill this important methodological and epistemological gap. First, I argue that this concept is distinct from the Bayesian notion of evidential support and that it plays an independent role in scientific reasoning. Second, I demonstrate that degree of corroboration cannot be suitably explicated in a probabilistic relevance framework, as proposed by Popper. Third, I derive two measures of corroboration that possess a large number of attractive properties, establish an insightful relation between corroboration and evidential support and are not committed to a Bayesian or a frequentist framework. In sum, the paper rethinks the foundations of inductive inference by providing a novel logic of hypothesis testing. (shrink)

Scoring rules measure the accuracy or epistemic utility of a credence assignment. A significant literature uses plausible conditions on scoring rules on finite sample spaces to argue for both probabilism—the doctrine that credences ought to satisfy the axioms of probabilism—and for the optimality of Bayesian update as a response to evidence. I prove a number of formal results regarding scoring rules on infinite sample spaces that impact the extension of these arguments to infinite sample spaces. A common condition in the (...) arguments for probabilism and Bayesian update is strict propriety: that according to each probabilistic credence, the expected accuracy of any other credence is worse. Much of the discussion needs to divide depending on whether we require finite or countable additivity of our probabilities. I show that in a number of natural infinite finitely additive cases, there simply do not exist strictly proper scoring rules, and the prospects for arguments for probabilism and Bayesian update are limited. In many natural infinite countably additive cases, on the other hand, there do exist strictly proper scoring rules that are continuous on the probabilities, and which support arguments for Bayesian update, but which do not support arguments for probabilism. There may be more hope for accuracy-based arguments if we drop the assumption that scores are extended-real-valued. I sketch a framework for scoring rules whose values are nets of extended reals, and show the existence of a strictly proper net-valued scoring rules in all infinite cases, both for f.a. and c.a. probabilities. These can be used in an argument for Bayesian update, but it is not at present known what is to be said about probabilism in this case. (shrink)

The best accuracy arguments for probabilism apply only to credence functions with finite domains, that is, credence functions that assign credence to at most finitely many propositions. This is a significant limitation. It reveals that the support for the accuracy-first program in epistemology is a lot weaker than it seems at first glance, and it means that accuracy arguments cannot yet accomplish everything that their competitors, the pragmatic (Dutch book) arguments, can. In this paper, I investigate the extent to (...) which this limitation can be overcome. Building on the best arguments in finite domains, I present two accuracy arguments for probabilism that are perfectly general—they apply to credence functions with arbitrary domains. I then discuss how the arguments’ premises can be challenged. We will see that it is particularly difficult to characterize admissible accuracy measures in infinite domains. (shrink)

By virtue of what do alarm calls and facial expressions carry natural information? The answer I defend in this paper is that they carry natural information by virtue of changing the probabilities of various states of affairs, relative to background data. The Probabilistic Difference Maker Theory of natural information that I introduce here is inspired by Dretske's [1981] seminal analysis of natural information, but parts ways with it by eschewing the requirements that information transmission must be nomically underwritten, mind-independent, (...) and knowledge-yielding. PDMT includes both a qualitative account of information transmission and a measure of natural information in keeping with the basic principles of Shannon's communication theory and Bayesian confirmation theory. It also includes a new account of the informational content of a signal, understood as the combination of the incremental and overall support that the signal provides for all states of affairs at the source. Finally, I compare and.. (shrink)

In his Logic, Pierre Gassendi proposes that our inductive inferences lack the information we would need to be certain of the claims that they suggest. Not even deductivist inference can insure certainty about empirical claims because the experientially attained premises with which we adduce support for such claims are no greater than probable. While something is surely amiss in calling deductivist inference "probabilistic," it seems Gassendi has hit upon a now-familiar, sensible point—namely, the use of deductive reasoning in (...) empirical contexts, while providing certain formal guarantees, does not insulate empirical arguments from judgment by the measure of belief which we invest in their premises. The more general point, which distinguishes Gassendi among his contemporaries, is that the strength shared by all empirical claims consists in the warrant from experience for those claims we introduce in their support. (shrink)

Marc Lange has criticized my assertion that relative to a Bayesian conception of inductive reasoning, Hume's argument for inductive scepticism cannot be run. I reply that the way in which Lange suggests one should run the Humean argument in a Bayesian framework ignores the fact that in Bayesian models of learning from experience, the domain of an agent's probability measure is exogenously determined. I also show that Lange is incorrect to equate probability distributions which 'support inductive inferences' with probability (...) distributions which assign probability to contingent propositions/events. (shrink)

Bayesian epistemology suggests various ways of measuring the support that a piece of evidence provides a hypothesis. Such measures are defined in terms of a subjective probability assignment, pr, over propositions entertained by an agent. The most standard measure (where “H” stands for “hypothesis” and “E” stands for “evidence”) is: the difference measure: d(H,E) = pr(H/E) - pr(H).0 This may be called a “positive (probabilistic) relevance measure” of confirmation, since, according to it, a piece of evidence E (...) qualitatively confirms a hypothesis H if and only if pr(H/E) > pr(H), where qualitative disconfirmation is characterized by replacing “>” with “ “ with “=”. Other more or less standard positive relevance measures that have been proposed are: the log-ratio measure: r(H,E) = log[pr(H/E)/pr(H)] and the log-likelihood-ratio measure: l(H,E) = log[pr(E/H)/pr(E/~H)]. (shrink)

I show that quantum theory is the only probabilistic framework that permits arbitrary processes to be emulated by sequences of local measurements. This supports the view that, contrary to conventional wisdom, measurement should not be regarded as a complex phenomenon in need of a dynamical explanation but rather as a primitive—and perhaps the only primitive—operation of the theory.

The question of whether humans represent grammatical knowledge as a binary condition on membership in a set of well-formed sentences, or as a probabilistic property has been the subject of debate among linguists, psychologists, and cognitive scientists for many decades. Acceptability judgments present a serious problem for both classical binary and probabilistic theories of grammaticality. These judgements are gradient in nature, and so cannot be directly accommodated in a binary formal grammar. However, it is also not possible to (...) simply reduce acceptability to probability. The acceptability of a sentence is not the same as the likelihood of its occurrence, which is, in part, determined by factors like sentence length and lexical frequency. In this paper, we present the results of a set of large-scale experiments using crowd-sourced acceptability judgments that demonstrate gradience to be a pervasive feature in acceptability judgments. We then show how one can predict acceptability judgments on the basis of probability by augmenting probabilistic language models with an acceptability measure. This is a function that normalizes probability values to eliminate the confounding factors of length and lexical frequency. We describe a sequence of modeling experiments with unsupervised language models drawn from state-of-the-art machine learning methods in natural language processing. Several of these models achieve very encouraging levels of accuracy in the acceptability prediction task, as measured by the correlation between the acceptability measure scores and mean human acceptability values. We consider the relevance of these results to the debate on the nature of grammatical competence, and we argue that they support the view that linguistic knowledge can be intrinsically probabilistic. (shrink)

The concept of an evidential conditional If A then C that can be defined by the conjunction of A>C and ¬C>¬A, where > is a conditional of the kind introduced by Stalnaker and Lewis, has recently been studied in a series of papers by Vincenzo Crupi and Andrea Iacona. In this paper I argue that Crupi and Iacona’s central idea that contraposition captures the idea of evidential support cannot be maintained. I give examples showing that contraposition is neither necessary (...) nor sufficient for a conditional’s antecedent supporting its consequent. Crupi and Iacona’s alternative account of evidential conditionals that is based on a probabilistic measure of evidential support cannot add to the credentials of their modal account, because both the theoretical role of contraposition and the resulting logic are different in this account. (shrink)

Definitions of syncopation share two characteristics: the presence of a meter or analogous hierarchical rhythmic structure and a displacement or contradiction of that structure. These attributes are translated in terms of a Bayesian theory of syncopation, where the syncopation of a rhythm is inferred based on a hierarchical structure that is, in turn, learned from the ongoing musical stimulus. Several experiments tested its simplest possible implementation, with equally weighted priors associated with different meters and independence of auditory events, which can (...) be decomposed into two terms representing note density and deviation from a metric hierarchy. A computational simulation demonstrated that extant measures of syncopation fall into two distinct factors analogous to the terms in the simple Bayesian model. Next, a series of behavioral experiments found that perceived syncopation is significantly related to both terms, offering support for the general Bayesian construction of syncopation. However, we also found that the prior expectations associated with different metric structures are not equal across meters and that there is an interaction between density and hierarchical deviation, implying that auditory events are not independent from each other. Together, these findings provide evidence that syncopation is a manifestation of a form of temporal expectation that can be directly represented in Bayesian terms and offer a complementary, feature‐driven approach to recent Bayesian models of temporal prediction. (shrink)

BackgroundDistorted gambling-related cognitions are tightly related to gambling problems, and are one of the main targets of treatment for disordered gambling, but their etiology remains uncertain. Although folk wisdom and some theoretical approaches have linked them to lower domain-general reasoning abilities, evidence regarding that relationship remains unconvincing.MethodIn the present cross-sectional study, the relationship between probabilistic/abstract reasoning, as measured by the Berlin Numeracy Test, and the Matrices Test, respectively, and the five dimensions of the Gambling-Related Cognitions Scale, was tested in (...) a sample of 77 patients with gambling disorder and 58 individuals without gambling problems.Results and interpretationNeither BNT nor matrices scores were significantly related to gambling-related cognitions, according to frequentist analyses, performed both considering and disregarding group in the models. Correlation Bayesian analyses largely supported the null hypothesis, i.e., the absence of relationships between the measures of interest. This pattern or results reinforces the idea that distorted cognitions do not originate in a general lack of understanding of probability or low fluid intelligence, but probably result from motivated reasoning. (shrink)

Probability ratio and likelihood ratio measures of inductive support and related notions have appeared as theoretical tools for probabilistic approaches in the philosophy of science, the psychology of reasoning, and artificial intelligence. In an effort of conceptual clarification, several authors have pursued axiomatic foundations for these two families of measures. Such results have been criticized, however, as relying on unduly demanding or poorly motivated mathematical assumptions. We provide two novel theorems showing that probability ratio and likelihood (...) ratio measures can be axiomatized in a way that overcomes these difficulties. (shrink)

In the recent literature on confirmation there are two leading approaches to the provision of a probabilistic measure of the degree to which a hypothesis is confirmed by evidence. The first is to construe the degree to which evidence E confirms hypothesis H as a function that is directly proportional to p and inversely proportional to p . I shall refer to this as the probability approach. The second approach construes the notion as a function that is directly proportional (...) to the true-positive rate – the probability of the evidence if the hypothesis is true, p – and inversely proportional to the false-positive rate – the probability of the evidence if the hypothesis is false, p . These reverse conditional probabilities – of the evidence on the truth or falsehood of the hypothesis – are sometimes known as likelihoods. I shall refer to the approach to confirmation that uses them as the likelihood approach.For each of these approaches, there are two obvious options as to how to define the confirmation function. The first is to define it as the difference between the magnitude that is treated as increasing confirmation or p ) and the magnitude that is treated as decreasing confirmation or p ). The second is to define confirmation as the quotient of these two magnitudes.This yields four different measures of confirmation, represented in the following table: Differences RatiosProbabilities PD = p – p1 PR = Graphic2Likelihoods LD = p – p3 LR = Graphic4All these measures agree on whether or not E provides some support for H. Intuitively, we want to say that E provides some support for H just in case learning that E is true would make us assign a higher probability to H, i.e. when p(H …. (shrink)

Probabilistic support is not transitive. There are cases in which x probabilistically supports y , i.e., Pr( y | x ) > Pr( y ), y , in turn, probabilistically supports z , and yet it is not the case that x probabilistically supports z . Tomoji Shogenji, though, establishes a condition for transitivity in probabilistic support, that is, a condition such that, for any x , y , and z , if Pr( y | x (...) ) > Pr( y ), Pr( z | y ) > Pr( z ), and the condition in question is satisfied, then Pr( z | x ) > Pr( z ). I argue for a second and weaker condition for transitivity in probabilistic support. This condition, or the principle involving it, makes it easier (than does the condition Shogenji provides) to establish claims of probabilistic support, and has the potential to play an important role in at least some areas of philosophy. (shrink)

Elementary results concerning the connections between deductive relations and probabilistic support are given. These are used to show that Popper-Miller's result is a special case of a more general result, and that their result is not very unexpected as claimed. According to Popper-Miller, a purely inductively supports b only if they are deductively independent — but this means that a b. Hence, it is argued that viewing induction as occurring only in the absence of deductive relations, as Popper-Miller (...) sometimes do, is untenable. Finally, it is shown that Popper-Miller's claim that deductive relations determine probabilistic support is untrue. In general, probabilistic support can vary greatly with fixed deductive relations as determined by the relevant Lindenbaum algebra. (shrink)

Support functions $s(h,e)=p(h\backslash e)-p(h)$ are widely used in discussion of explanation, causality and, recently, in connection with the possibility or otherwise of probabilistic induction. With this latter application in view, a rather complete analysis of the variety of support functions, their interrelationships and their "non-deductive" and "inductive" components is presented. With the restriction to two propositions, three variable probabilities are enough to discuss such problems. The analysis is illustrated by graphs, a Venn diagram and by using the (...) Laplace Rule of Succession as an illustrative example. It is concluded that within this framework one cannot prove or disprove the possibility of probabilistic induction. (shrink)

The propositional language extended by two families of unary propositional probability operators and the corresponding list of probability measure axioms concerning those operators is the basis of the system preseted here. We describe a Kripke-type possible worlds semantics covering such a kind of logical systems.1.

As is well known, implication is transitive but probabilistic support is not. Eells and Sober, followed by Shogenji, showed that screening off is a sufficient constraint for the transitivity of probabilistic support. Moreover, this screening off condition can be weakened without sacrificing transitivity, as was demonstrated by Suppes and later by Roche. In this paper we introduce an even weaker sufficient condition for the transitivity of probabilistic support, in fact one that can be made (...) as weak as one wishes. We explain that this condition has an interesting property: it shows that transitivity is retained even though the Simpson paradox reigns. We further show that by adding a certain restriction the condition can be turned into one that is both sufficient and necessary for transitivity. (shrink)

This paper examines how coherence of the contents of evidence affects the transmission of probabilistic support from the evidence to the hypothesis. It is argued that coherence of the contents in the sense of the ratio of the positive intersection reduces the transmission of probabilistic support, though this negative impact of coherence may be offset by other aspects of the relations among the contents. It is argued further that there is no broader conception of coherence whose (...) impact on the transmission of probabilistic support is never offset by other aspects of the relations among the contents. The paper also examines reasons for the contrary impression that coherence of the contents increases the transmission of probabilistic support, especially in the special case where the hypothesis to evaluate is the conjunction of the contents of evidence. (shrink)

It is well known that probabilistic support is not transitive. But it can be shown that probabilistic support is transitive provided the intermediary proposition screens off the original evidence with respect to the hypothesis in question. This has the consequence that probabilistic support is transitive when the original evidence is testimonial, memorial or perceptual (i.e., to the effect that such and such was testified to, remembered, or perceived), and the intermediary proposition is its representational (...) content (i.e., to the effect that the such and such occurred). (shrink)

There is a long-standing debate in epistemology on the structure of justification. Some recent work in formal epistemology promises to shed some new light on that debate. I have in mind here some recent work by David Atkinson and Jeanne Peijnenburg, hereafter “A&P”, on infinite regresses of probabilistic support. A&P show that there are probability distributions defined over an infinite set of propositions {\ such that \ is probabilistically supported by \ for all i and \ has a (...) high probability. Let this result be “APR”. A&P oftentimes write as though they believe that APR runs counter to foundationalism. This makes sense, since there is some prima facie plausibility in the idea that APR runs counter to foundationalism, and since some prominent foundationalists argue for theses inconsistent with APR. I argue, though, that in fact APR does not run counter to foundationalism. I further argue that there is a place in foundationalism for infinite regresses of probabilistic support. (shrink)

As is well known, implication is transitive but probabilistic support is not. Eells and Sober, followed by Shogenji, showed that screening off is a sufficient constraint for the transitivity of probabilistic support. Moreover, this screening off condition can be weakened without sacrificing transitivity, as was demonstrated by Suppes and later by Roche. In this paper we introduce an even weaker sufficient condition for the transitivity of probabilistic support, in fact one that can be made (...) as weak as one wishes. We explain that this condition has an interesting property: it shows that transitivity is retained even though the Simpson paradox reigns. We further show that by adding a certain restriction the condition can be turned into one that is both sufficient and necessary for transitivity. (shrink)

The probabilistic support relation is known to violate transitivity. But over the years, philosophers have identified various conditions under which it does not, most notably screening-off and weak screening-off. In this short discussion note, I wish to highlight another condition that, unfortunately, is often neglected in the literature. This condition is due to Mary Hesse who recognized its transitivity-ensuring property long before other conditions entered the stage. I show that her condition is logically independent of screening-off and weak (...) screening-off, but that, just like the two aforementioned, it entails the recently proposed very weak screening-off condition due to Jeanne Peijnenburg and David Atkinson. (shrink)

Introduction. The inadequacy of the support measures provided to children with orphan diseases is exacerbated by the trend towards an increase in the number of children with such a diagnosis. Orphan diseases also include diseases caused by primary immunodeficiency or congenital errors of immunity, which are life-threatening. However, these people are part of society and require attention from it, and social and economic measures from the state. Most of them, with proper treatment, socialization and appropriate government (...) class='Hi'>support, can lead a normal life and live a full life. Scientific novelty of the research. On the basis of the study results, the authors contribute to clarifying the principles used in the implementation of the security function of the social state. The targeting of social support measures must be supplemented with the principles of social justice and freedom to choose ways to meet the needs of specific categories of citizens, understood as follows. The welfare state supports those citizens who need it most of all, namely, the poor. Specific categories of citizens can satisfy their needs, while having the opportunity to choose. This opportunity arises thanks to the receipt of targeted assistance in the form of monthly or annual subsidies. Families with children with orphan diseases should also be included in these categories. If they have the right to receive annual government subsidies, they will be able to spend these funds depending on the current needs due to the state of health of their children with orphan diseases (for the purchase of socially important food products; medicines, medical nutrition, and various services). The aim of the work is to study the problems of providing support measures to children with orphan diseases in the context of the current model of the welfare state. The article analyzes the satisfaction of patients with congenital immunity errors with various types of state support, identifies problems that reduce their satisfaction. Methods. The authors use methods such as comparative analysis, study of regulatory legal acts, sociological analysis. Results. On the basis of the study results the effectiveness of measures of state support for children with orphan diseases, studying the best experience of foreign countries, proposals were made to clarify the principles used to implement the security function by the social state, to expand the composition of the subjects involved in providing support measures analyzed in the article. Conclusions. The results obtained make it possible to assert that the targeted approach, which is basic in the model of the welfare state, does not cover most of the problems of children with innate immunity errors and, accordingly, the families that represent their interests. (shrink)

Recently, in attempting to account for explanatory reasoning in probabilistic terms, Bayesians have proposed several measures of the degree to which a hypothesis explains a given set of facts. These candidate measures of "explanatory power" are shown to have interesting normative interpretations and consequences. What has not yet been investigated, however, is whether any of these measures are also descriptive of people’s actual explanatory judgments. Here, I present my own experimental work investigating this question. I argue (...) that one measure in particular is an accurate descriptor of explanatory judgments. Then, I discuss some interesting implications of this result for both the epistemology and the psychology of explanatory reasoning. (shrink)

This paper introduces the logic of evidence and truth \ as an extension of the Belnap–Dunn four-valued logic \. \ is a slightly modified version of the logic \, presented in Carnielli and Rodrigues. While \ is equipped only with a classicality operator \, \ is equipped with a non-classicality operator \ as well, dual to \. Both \ and \ are logics of formal inconsistency and undeterminedness in which the operator \ recovers classical logic for propositions in its scope. (...) Evidence is a notion weaker than truth in the sense that there may be evidence for a proposition \ even if \ is not true. As well as \, \ is able to express preservation of evidence and preservation of truth. The primary aim of this paper is to propose a probabilistic semantics for \ where statements \\) and \\) express, respectively, the amount of evidence available for \ and the degree to which the evidence for \ is expected to behave classically—or non-classically for \ \). A probabilistic scenario is paracomplete when \ + P 1\), and in both cases, \ < 1\). If \ = 1\), or \ = 0\), classical probability is recovered for \. The proposition \, a theorem of \, partitions what we call the information space, and thus allows us to obtain some new versions of known results of standard probability theory. (shrink)

It is shown that the probabilistic theories of coherence proposed up to now produce a number of counter-intuitive results. The last section provides some reasons for believing that no probabilistic measure will ever be able to adequately capture coherence. First, there can be no function whose arguments are nothing but tuples of probabilities, and which assigns different values to pairs of propositions {A, B} and {A, C} if A implies both B and C, or their negations, and if (...) P(B)=P(C). But such sets may indeed differ in their degree of coherence. Second, coherence is sensitive to explanatory relations between the propositions in question. Explanation, however, can hardly be captured solely in terms of probability. (shrink)

I explain the difficulty of making various concepts of and relating to probability precise, rigorous and physically significant when attempting to apply them in reasoning about objects living in infinite-dimensional spaces, working through many examples from cosmology. I focus on the relation of topological to measure-theoretic notions of and relating to probability, how they diverge in unpleasant ways in the infinite-dimensional case, and are even difficult to work with on their own. Even in cases where an appropriate family of spacetimes (...) is finite-dimensional, and so admits a measure of the relevant sort, however, it is always the case that the family is not a compact topological space, and so does not admit a physically significant, well behaved probability measure. Problems of a different but still deeply troubling sort plague arguments about likelihood in that context, which I also discuss. I conclude that most standard forms of argument used in cosmology to estimate the likelihood of the occurrence of various properties or behaviors of spacetimes have serious mathematical, physical and conceptual problems. (shrink)

Coherentism in epistemology has long suffered from lack of formal and quantitative explication of the notion of coherence. One might hope that probabilistic accounts of coherence such as those proposed by Lewis, Shogenji, Olsson, Fitelson, and Bovens and Hartmann will finally help solve this problem. This paper shows, however, that those accounts have a serious common problem: the problem of belief individuation. The coherence degree that each of the accounts assigns to an information set (or the verdict it gives (...) as to whether the set is coherent tout court) depends on how beliefs (or propositions) that represent the set are individuated. Indeed, logically equivalent belief sets that represent the same information set can be given drastically different degrees of coherence. This feature clashes with our natural and reasonable expectation that the coherence degree of a belief set does not change unless the believer adds essentially new information to the set or drops old information from it; or, to put it simply, that the believer cannot raise or lower the degree of coherence by purely logical reasoning. None of the accounts in question can adequately deal with coherence once logical inferences get into the picture. Toward the end of the paper, another notion of coherence that takes into account not only the contents but also the origins (or sources) of the relevant beliefs is considered. It is argued that this notion of coherence is of dubious significance, and that it does not help solve the problem of belief individuation. (shrink)

All extant purely probabilistic measures of explanatory power satisfy the following technical condition: if Pr(E | H1) > Pr(E | H2) and Pr(E | ∼H1) < Pr(E | ∼H2), then H1’s explanatory power with respect to E is greater than H2’s explanatory power with respect to E. We argue that any measure satisfying this condition faces three serious problems—the Problem of Temporal Shallowness, the Problem of Negative Causal Interactions, and the Problem of Nonexplanations. We further argue that many (...) such measures face a fourth problem—the Problem of Explanatory Irrelevance. (shrink)

Coherence is a measure of how much our beliefs hang together. Understanding is achieved when we see that something is not just a brute, isolated fact. This suggests that it might be possible to use the extant probabilistic measures of coherence to formulate a measure of understanding. We attempt to do so, but it turns out that a coherence theory runs into trouble with the asymmetry of understanding. We identify four difficulties and show how they have been solved (...) by a unification approach to explanation. We also identify four advantages of the coherence approach, and assess the possibilities of reconciling the strengths of the two approaches.La coherencia es una medida sobre cuanta interdependencia hay entre nuestras creencias. La comprension se obtiene cuando vemos que algo no es un hecho bruto, aislado. Esto sugiere la posibilidad de usar las medidas probabilisticas de coherencia al uso para elaborar una medida de la comprension. Explorare esta posibilidad, a pesar de que una teoria de la coherencia tropieza con problemas aqui dado el caracter asimetrico de la comprension. Identifico cuatro dificultades al respecto y muestro como han sido resueltas mediante un enfoque de la explicacion basado en la nocion de unificacion. Tambien identifico cuatro ventajas en la aproximacion desde la coherencia y examino que perspectivas hay de reconciliar los puntos fuertes de ambos planteamientos. (shrink)

Several theoretical publications on the Dirac equation published during the last decades have shown that, an interpretation is possible, which ascribes the origin of electron spin and magnetic moment to an autonomous circular motion of the point-like charged particle around a fixed centre. In more recent publications an extension of the original so called “Zitterbewegung Interpretation” of quantum mechanics was suggested, in which the spin results from an average of instantaneous spin vectors over a Zitterbewegung period. We argue that, the (...) corresponding autonomous motion of the electron should, if it is real, determine non-relativistic spin measurements. Such a direct connection with the established formal quantum mechanical description of spin measurements, into which spin is introduced as a “non-classical” quantity has, to our knowledge, not been reported. In the present work we show that, under certain “model assumptions” concerning the proposed autonomous motion, results of spin measurements, including measurements of angular correlations in singlet systems, can indeed be correctly described using classical probabilities. The success of the model is evidence for the “reality” of the assumed autonomous motion. The resulting model violates the Bell—inequalities to the same extent as quantum mechanics. (shrink)

Several philosophers propose probabilistic measures of how well a potential scientific explanation would explain the given evidence. These measures could elaborate “best” in “inference to the best explanation”. This paper argues that none of these measures succeeds. The paper considers the various rival explanations that scientists proposed for the parallelogram of forces. Scientists regarded various features of these proposals as making them more or less “lovely”. None of these probabilistic measures of loveliness can reflect (...) these features. The paper concludes by considering the kinds of probabilities that could reflect these features. (shrink)

How can we determine the adequacy of a probabilistic coherence measure? A widely accepted approach to this question besides formulating adequacy constraints is to employ paradigmatic test cases consisting of a scenario providing a joint probability distribution over some specified set of propositions coupled with a normative coherence assessment for this set. However, despite the popularity of the test case approach, a systematic evaluation of the proposed test cases is still missing. This paper’s aim is to change this. Using (...) a custom written computer program for the necessary probabilistic calculations a large number of coherence measures in an extensive collection of test cases is examined. The result is a detailed overview of the test case performance of any probabilistic coherence measures proposed so far. It turns out that none of the popular coherence measures such as Shogenji’s, Glass’ and Olsson’s, Fitelson’s or Douven and Meijs’ but two rather unnoticed measures perform best. This, however, does not mean that the other measures can be rejected straightforwardly. Instead, the results presented here are to be understood as a contribution among others to the project of finding adequate probabilistic coherence measures. (shrink)

Algebraic theories for extensive measurement are traditionally framed in terms of a binary relation $\lesssim $ and a concatenation (x,y)→ xy. For situations in which the data is "noisy," it is proposed here to consider each expression $y\lesssim x$ as symbolizing an event in a probability space. Denoting P(x,y) the probability of such an event, two theories are discussed corresponding to the two representing relations: p(x,y)=F[m(x)-m(y)], p(x,y)=F[m(x)/m(y)] with m(xy)=m(x)+m(y). Axiomatic analyses are given, and representation theorems are proven in detail.

Two of the probabilistic measures of coherence discussed in this paper take probabilistic dependence into account and so depend on prior probabilities in a fundamental way. An example is given which suggests that this prior-dependence can lead to potential problems. Another coherence measure is shown to be independent of prior probabilities in a clearly defined sense and consequently is able to avoid such problems. The issue of prior-dependence is linked to the fact that the first two (...) class='Hi'>measures can be understood as measures of coherence as striking agreement, while the third measure represents coherence as agreement. Thus, prior (in)dependence can be used to distinguish different conceptions of coherence. (shrink)