De Finetti would claim that we can make sense of a draw in which each positive integer has equal probability of winning. This requires a uniform probability distribution over the natural numbers, violating countable additivity. Countable additivity thus appears not to be a fundamental constraint on subjective probability. It does, however, seem mandated by Dutch Book arguments similar to those that support the other axioms of the probability calculus as compulsory for subjective interpretations. These two lines of reasoning can be (...) reconciled through a slight generalization of the Dutch Book framework. Countable additivity may indeed be abandoned for de Finetti's lottery, but this poses no serious threat to its adoption in most applications of subjective probability. Introduction The de Finetti lottery Two objections to equiprobability 3.1 The ‘No random mechanism’ argument 3.2 The Dutch Book argument Equiprobability and relative betting quotients The re-labelling paradox 5.1 The paradox 5.2 Resolution: from symmetry to relative probability Beyond the de Finetti lottery. (shrink)

The Dutch Book argument, like Route 66, is about to turn 80. It is arguably the most celebrated argument for subjective Bayesianism. Start by rejecting the Cartesian idea that doxastic attitudes are ‘all-or-nothing’; rather, they are far more nuanced degrees of belief, for short credences, susceptible to fine-grained numerical measurement. Add a coherentist assumption that the rationality of a doxastic state consists in its internal consistency. The remaining problem is to determine what consistency of credences amounts to. The Dutch Book (...) argument, in a nutshell, says that if your credences do not obey the probability calculus, you are ‘incoherent’—susceptible to sure losses at the hands of a ‘Dutch Bookie’—and thus irrational. Conclusion: rationality requires your credences to obey the probability calculus. And like Route 66, the fortunes of the Dutch Book argument have been mixed. Opinions on the argument are sharply divided. The list of its proponents is quite a ‘who’s who’ of philosophers of probability; they include de Finetti (1937, 1980), Carnap (1950, 1962, and more fully, 1955), Kemeny (1955), Lehman (1955), Shimony (1955), Adams (1962), Mellor (1971), Rosenkrantz (1981), van Fraassen (1989), Jeffrey (1983, 1992). (shrink)

Four important arguments for probabilism—the Dutch Book, representation theorem, calibration, and gradational accuracy arguments—have a strikingly similar structure. Each begins with a mathematical theorem, a conditional with an existentially quantified consequent, of the general form: if your credences are not probabilities, then there is a way in which your rationality is impugned. Each argument concludes that rationality requires your credences to be probabilities. I contend that each argument is invalid as formulated. In each case there is a mirror-image theorem and (...) a corresponding argument of exactly equal strength that concludes that rationality requires your credences not to be probabilities. Some further consideration is needed to break this symmetry in favour of probabilism. (shrink)

Events between which we have no epistemic reason to discriminate have equal epistemic probabilities. Bertrand’s chord paradox, however, appears to show this to be false, and thereby poses a general threat to probabilities for continuum sized state spaces. Articulating the nature of such spaces involves some deep mathematics and that is perhaps why the recent literature on Bertrand’s Paradox has been almost entirely from mathematicians and physicists, who have often deployed elegant mathematics of considerable sophistication. At the same time, the (...) philosophy of probability has been left out. In particular, left out entirely are the philosophical ground of the principle of indifference, the nature of the principle itself, the stringent constraint this places on the mathematical representation of the principle needed for its application to continuum sized event spaces, and what these entail for rigour in developing the paradox itself. This book puts the philosophy and its entailments back in and in so doing casts a new light on the paradox, giving original analyses of the paradox, its possible solutions, the source of the paradox, the philosophical errors we make in attempting to solve it and what the paradox proves for the philosophy of probability. The book finishes with the author’s proposed solution—a solution in the spirit of Bertrand’s, indeed—in which an epistemic principle more general than the principle of indifference offers a principled restriction of the domain of the principle of indifference. (shrink)

Hájek (Erkenntnis 70(2):211–235, 2009) argues that probabilities cannot be the limits of relative frequencies in counterfactual infinite sequences. I argue for a different understanding of these limits, drawing on Norton’s (Philos Sci 79(2):207–232, 2012) distinction between approximations (inexact descriptions of a target) and idealizations (separate models that bear analogies to the target). Then, I adapt Hájek’s arguments to this new context. These arguments provide excellent reasons not to use hypothetical frequencies as idealizations, but no reason not to use them as (...) approximations. (shrink)

An infinite lottery machine is used as a foil for testing the reach of inductive inference, since inferences concerning it require novel extensions of probability. Its use is defensible if there is some sense in which the lottery is physically possible, even if exotic physics is needed. I argue that exotic physics is needed and describe several proposals that fail and at least one that succeeds well enough.

The principle of indifference is supposed to suffice for the rational assignation of probabilities to possibilities. Bertrand advances a probability problem, now known as his paradox, to which the principle is supposed to apply; yet, just because the problem is ill‐posed in a technical sense, applying it leads to a contradiction. Examining an ambiguity in the notion of an ill‐posed problem shows that there are precisely two strategies for resolving the paradox: the distinction strategy and the well‐posing strategy. The main (...) contenders for resolving the paradox, Marinoff and Jaynes, offer solutions which exemplify these two strategies. I show that Marinoff’s attempt at the distinction strategy fails, and I offer a general refutation of this strategy. The situation for the well‐posing strategy is more complex. Careful formulation of the paradox within measure theory shows that one of Bertrand’s original three options can be ruled out but also shows that piecemeal attempts at the well‐posing strategy will not succeed. What is required is an appeal to general principle. I show that Jaynes’s use of such a principle, the symmetry requirement, fails to resolve the paradox; that a notion of metaindifference also fails; and that, while the well‐posing strategy may not be conclusively refutable, there is no reason to think that it can succeed. So the current situation is this. The failure of Marinoff’s and Jaynes’s solutions means that the paradox remains unresolved, and of the only two strategies for resolution, one is refuted and we have no reason to think the other will succeed. Consequently, Bertrand’s paradox continues to stand in refutation of the principle of indifference. (shrink)

Probability logics have been an active topic of investigation of beliefs in type spaces in game theoretical economics. Beliefs are expressed as subjective probability measures. Savage’s postulates in decision theory imply that subjective probability measures are not necessarily countably additive but finitely additive. In this paper, we formulate a probability logic Σ + that is strongly complete with respect to this class of type spaces with finitely additive probability measures, i.e. a set of formulas is consistent in Σ + iff (...) it is satisfied in a finitely additive type space. Although we can characterize Σ + -theories satisfiable in the class as maximally consistent sets of formulas, we prove that any canonical model of maximally consistent sets is not universal in the class of type spaces with finitely additive measures, and, moreover, it is not a type space. At the end of this paper, we show that even a minimal use of probability indices causes the failure of compactness in probability logics. (shrink)

(No abstract is available for this citation).

Objective Bayesian probability is often defined over rather simple domains, e.g., finite event spaces or propositional languages. This paper investigates the extension of objective Bayesianism to first-order logical languages. It is argued that the objective Bayesian should choose a probability function, from all those that satisfy constraints imposed by background knowledge, that is closest to a particular frequency-induced probability function which generalises the λ = 0 function of Carnap’s continuum of inductive methods.

(No abstract is available for this citation).

Bayesian probability is normally defined over a fixed language or eventspace. But in practice language is susceptible to change, and thequestion naturally arises as to how Bayesian degrees of belief shouldchange as language changes. I argue here that this question poses aserious challenge to Bayesianism. The Bayesian may be able to meet thischallenge however, and I outline a practical method for changing degreesof belief over changes in finite propositional languages.

The topic of this paper is our knowledge of the natural numbers, and in particular, our knowledge of the basic axioms for the natural numbers, namely the Peano axioms. The thesis defended in this paper is that knowledge of these axioms may be gained by recourse to judgements of probability. While considerations of probability have come to the forefront in recent epistemology, it seems safe to say that the thesis defended here is heterodox from the vantage point of traditional philosophy (...) of mathematics. So this paper focuses on providing a preliminary defense of this thesis, in that it focuses on responding to several objections. Some of these objections are from the classical literature, such as Frege's concern about indiscernibility and circularity, while other are more recent, such as Baker's concern about the unreliability of small samplings in the setting of arithmetic. Another family of objections suggests that we simply do not have access to probability assignments in the setting of arithmetic, either due to issues related to the~$\omega$-rule or to the non-computability and non-continuity of probability assignments. Articulating these objections and the responses to them involves developing some non-trivial results on probability assignments, such as a forcing argument to establish the existence of continuous probability assignments that may be computably approximated. In the concluding section, two problems for future work are discussed: developing the source of arithmetical confirmation and responding to the probabilistic liar. (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)

In this paper a theory of finitistic and frequentistic approximations — in short: f-approximations — of probability measures P over a countably infinite outcome space N is developed. The family of subsets of N for which f-approximations converge to a frequency limit forms a pre-Dynkin system $${{D\subseteq\wp(N)}}$$. The limiting probability measure over D can always be extended to a probability measure over $${{\wp(N)}}$$, but this measure is not always σ-additive. We conclude that probability measures can be regarded as idealizations of (...) limiting frequencies if and only if σ-additivity is not assumed as a necessary axiom for probabilities. We prove that σ-additive probability measures can be characterized in terms of so-called canonical and in terms of so-called full f-approximations. We also show that every non-σ-additive probability measure is f-approximable, though neither canonically nor fully f-approximable. Finally, we transfer our results to probability measures on open or closed formulas of first-order languages. (shrink)

Currently, the most popular views about how to update de se or self-locating beliefs entail the one-third solution to the Sleeping Beauty problem.2 Another widely held view is that an agent‘s credences should be countably additive.3 In what follows, I will argue that there is a deep tension between these two positions. For the assumptions that underlie the one-third solution to the Sleeping Beauty problem entail a more general principle, which I call the Generalized Thirder Principle, and there are situations (...) in which the latter principle and the principle of Countable Additivity cannot be jointly satisfied. The most plausible response to this tension, I argue, is to accept both of these principles, and to maintain that when an agent cannot satisfy them both, she is faced with a rational dilemma. (shrink)

This paper defends the claim that there is a deep tension between the principle of countable additivity and the one-third solution to the Sleeping Beauty problem. The claim that such a tension exists has recently been challenged by Brian Weatherson, who has attempted to provide a countable additivity-friendly argument for the one-third solution. This attempt is shown to be unsuccessful. And it is argued that the failure of this attempt sheds light on the status of the principle of indifference that (...) underlies the tension between countable additivity and the one-third solution. (shrink)

The Capgras delusion is a condition in which a person believes that an imposter has replaced some close friend or relative. Recent theorists have appealed to Bayesianism to help explain both why a subject with the Capgras delusion adopts this delusional belief and why it persists despite counter-evidence. The Bayesian approach is useful for addressing these questions; however, the main proposal of this essay is that Capgras subjects also have a delusional conception of epistemic possibility, more specifically, they think more (...) things are possible, given what is known, than non-delusional subjects do. I argue that this is a central way in which their thinking departs from ordinary cognition and that it cannot be characterized in Bayesian terms. Thus, in order to fully understand the cognitive processing involved in the Capgras delusion, we must move beyond Bayesianism. 1 The Simple Bayesian Model2 Anomalous Evidence and the Capgras Delusion3 Impaired Reasoning4 Setting Priors5 Epistemic Modality6 Delusions of Possibility7 Delusions of Possibility in Different Contexts8 How Many Factors? (shrink)

Vann McGee has argued that, given certain background assumptions and an ought-implies-can thesis about norms of rationality, Bayesianism conflicts globally with computationalism due to the fact that Robinson arithmetic is essentially undecidable. I show how to sharpen McGee's result using an additional fact from recursion theory—the existence of a computable sequence of computable reals with an uncomputable limit. In conjunction with the countable additivity requirement on probabilities, such a sequence can be used to construct a specific proposition to which Bayesianism (...) requires an agent to assign uncomputable credence—yielding a local conflict with computationalism. (shrink)

This paper addresses the issue of finite versus countable additivity in Bayesian probability and decision theory -- in particular, Savage's theory of subjective expected utility and personal probability. I show that Savage's reason for not requiring countable additivity in his theory is inconclusive. The assessment leads to an analysis of various highly idealised assumptions commonly adopted in Bayesian theory, where I argue that a healthy dose of, what I call, conceptual realism is often helpful in understanding the interpretational value of (...) sophisticated mathematical structures employed in applied sciences like decision theory. In the last part, I introduce countable additivity into Savage's theory and explore some technical properties in relation to other axioms of the system. (shrink)

The purpose of this paper is to discuss the role of financial practice in the development of mathematics as applied in human judgement. The basis of the paper is in historical research from the 1990s that argues that the monetisation of western commerce, which abstracted value into quantified price, was synthesised with scholastic analysis resulting in a “mathematical mechanistic world picture” that led to the widespread use of mathematics in science from the seventeenth century. An aspect of this process was (...) the quantification of chance that led to the development of mathematical probability, the branch of mathematics most relevant to judgement and the focus of this paper. Ideas from this historical research are related to the fundamental theorem of asset pricing, the foundational theory of contemporary financial mathematics. The paper observes that vestiges of medieval scholastic attitudes to financial ethics can be discerned in the FTAP, offering a novel interpretation of the mathematical theorem. The paper then considers the Dutch book argument, the most popular justification for subjective probability. The paper’s main contribution is in describing the significance of financial practice in validating the DBA and the paper explains how the FTAP addresses some criticisms of how the DBA represents beliefs. The conclusions emphasise the distinction between pure and practical reasoning and that this should be mirrored in a distinction between the mathematics of physica and practica. This point is important as mathematics is becoming more widespread in modelling, and directing, social systems. (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)

At a very fundamental level an individual (or a computer) can process only a finite amount of information in a finite time. We can therefore model the possibilities facing such an observer by a tree with only finitely many arcs leaving each node. There is a natural field of events associated with this tree, and we show that any finitely additive probability measure on this field will also be countably additive. Hence when considering the foundations of Bayesian statistics we may (...) as well assume countable additivity over a σ-field of events. (shrink)

Four important arguments for probabilism—the Dutch Book, representation theorem, calibration, and gradational accuracy arguments—have a strikingly similar structure. Each begins with a mathematical theorem, a conditional with an existentially quantified consequent, of the general form: if your credences are not probabilities, then there is a way in which your rationality is impugned.Each argument concludes that rationality requires your credences to be probabilities.I contend that each argument is invalid as formulated. In each case there is a mirror-image theorem and a corresponding (...) argument of exactly equal strength that concludes that rationality requires your credences not to be probabilities. Some further consideration is needed to break this symmetry in favour of probabilism. I discuss the extent to which the original arguments can be buttressed.1. Introduction2. The Dutch Book Argument2.1. Saving the Dutch Book argument2.2. ‘The Dutch Book argument merely dramatizes an inconsistency in the attitudes of an agent whose credences violate probability theory’3. Representation Theorem-based Arguments4. The Calibration Argument5. The Gradational Accuracy Argument6. Conclusion. (shrink)

Philosophers cannot agree on whether the rule of Countable Additivity should be an axiom of probability. Edwin T. Jaynes attacks the problem in a way which is original to him and passed over in the current debate about the principle: he says the debate only arises because of an erroneous use of mathematical infinity. I argue that this solution fails, but I construct a different argument which, I argue, salvages the spirit of the more general point Jaynes makes. I argue (...) that in Jaynes’s objective Bayesianism we might have good reasons to adopt Countable Additivity, and some of the major problems this adoption is known to entail need not worry us. In particular, I propose to adopt this new angle on Countable Additivity in Jon Williamson’s version of objective Bayesianism. (shrink)

It is sometimes alleged that arguments that probability functions should be countably additive show too much, and that they motivate uncountable additivity as well. I show this is false by giving two naturally motivated arguments for countable additivity that do not motivate uncountable additivity.

Many philosophers have become worried about the use of standard real numbers for the probability function that represents an agent's credences. They point out that real numbers can't capture the distinction between certain extremely unlikely events and genuinely impossible ones—they are both represented by credence 0, which violates a principle known as “regularity.” Following Skyrms 1980 and Lewis 1980, they recommend that we should instead use a much richer set of numbers, called the “hyperreals.” This essay argues that this popular (...) view is the result of two mistakes. The first mistake, which this essay calls the “numerical fallacy,” is to assume that a distinction that isn't represented by different numbers isn't represented at all in a mathematical representation. In this case, the essay claims that although the real numbers do not make all relevant distinctions, the full mathematical structure of a probability function does. The second mistake is that the hyperreals make too many distinctions. They have a much more complex structure than credences in ordinary propositions can have, so they make distinctions that don't exist among credences. While they might be useful for generating certain mathematical models, they will not appear in a faithful mathematical representation of credences of ordinary propositions. (shrink)

Bayesianism is a collection of positions in several related fields, centered on the interpretation of probability as something like degree of belief, as contrasted with relative frequency, or objective chance. However, Bayesianism is far from a unified movement. Bayesians are divided about the nature of the probability functions they discuss; about the normative force of this probability function for ordinary and scientific reasoning and decision making; and about what relation (if any) holds between Bayesian and non-Bayesian concepts.

A number of philosophers have thought that fair lotteries over countably infinite sets of outcomes are conceptually incoherent by virtue of violating countable additivity. In this article, I show that a qualitative analogue of this argument generalizes to an argument against the conceptual coherence of a much wider class of fair infinite lotteries—including continuous uniform distributions. I argue that this result suggests that fair lotteries over countably infinite sets of outcomes are no more conceptually problematic than continuous uniform distributions. Along (...) the way, I provide a novel argument for a weak qualitative, epistemic version of regularity. (shrink)

Przedmowa Problematyka związana z zależnościami przyczynowymi, ich modelowaniem i odkrywa¬niem, po długiej nieobecności w filozofii i metodologii nauk, budzi współcześnie duże zainteresowanie. Wiąże się to przede wszystkim z dynamicznym rozwojem, zwłaszcza od lat 1990., technik obli¬czeniowych. Wypracowane w tym czasie sieci bayesowskie uznaje się za matematyczny język przyczynowości. Pozwalają one na daleko idącą auto¬matyzację wnioskowań, co jest także zachętą do podjęcia prób algorytmiza¬cji odkrywania przyczyn. Na potrzeby badań naukowych, które pozwalają na przeprowadzenie eksperymentu z randomizacją, standardowe metody ustalania zależności przyczynowych (...) opracowano na początku XX wieku. Zupełnie inaczej sprawa przedstawia się w przypadku badań nieeksperymentalnych, gdzie podobne rozwiązania pozostają kwestią przyszłości. Zadaniem tej książki jest podanie warunków, które powinny być spełnione przez te rozwiązania, oraz sformułowanie proceduralnego kryterium zależności przy¬czynowych jako szczegółowej realizacji tych warunków. Pociąga ono waż¬kie konsekwencje dla filozofii i metodologii nauk, które ujawnia – podany w Części II – zarys me-todolo¬gii proceduralnej. W literaturze przedmiotu brakuje w miarę wszechstronnego i systema¬tycznego omówie¬nia najnowszych filozoficznych i metodologicznych dys¬kusji na temat przy¬czynowości, co niech będzie wytłumaczeniem, dlaczego w niektórych punktach obecnej książki szczegółowo referuję trudno dos¬tępne teksty źró¬dłowe. Przymiotnik „proceduralny” używam tu w znaczeniu węższym niż Huw Price (w którego pracach właściwszy byłby termin „kryterialny”) dla podkre¬ślenia – zgodnie z łacińskim źródłosłowem procedo – że dla ustalenia przy¬czyny niezbędne jest podjęcie przez uczonych określonych interakcji z ba¬daną rzeczywistością. Zalążki zamysłu prezentowanego w tej książce przedstawiłem podczas warsztatów filozoficznych „Philosophy and Probability” w roku 2002, zor¬ganizowanych przez Instytut Filozofii Uniwersytetu w Konstancji. Wdzięczny jestem uczestnikom tych warsztatów za uwagi, a przede wszyst¬kim następującym osobom: Luc Bovens, Brandon Fitelson, Alan Hájek, Stephan Hartmann oraz Jon Williamson. Podczas międzynarodowej konferencji „Analytical Pragmatism”, zorgani¬zowanej w Lublinie w roku 2003 przez Wydział Filo¬zofii Katolickiego Uniwersytetu Lubelskiego, odniosłem swoją koncepcję do prac Nancy Cartwright. Szczególnie inspirujący okazał się komentarz Huw Price’a do mojego referatu i przeprowadzona z nim dysku¬sja. Ujęcie koncepcji metodologii proceduralnej na szerszym tle współ-czes¬nego nurtu empirystycznego w filozofii nauki przedstawiłem w roku 2004 podczas konferencji „5th Quadrennial Fellows Conference”, zorgani¬zowanej przez Instytut Filozofii Uniwersytetu Jagiellońskiego oraz Centrum Filozofii Nauki w Pittsburghu. Szczególnie pomocne w dalszych moich pra¬cach były uwagi Jamesa Bogena, Janet Kourany, Jamesa Lennoxa, Johna Nortona, Thomasa Bonka, Jana Woleńskiego i Johna Worralla, za które wyra¬żam swoją wdzięczność. Korpus książki powstał podczas mojego stażu w Centrum Filozofii Nauki w Pittsburghu, który odbyłem jako stypendysta Fundacji na Rzecz Nauki Polskiej w roku akademickim 2004-2005. Uczestniczyłem w tym czasie w życiu naukowym Centrum i w pracach badawczych zespołu z Instytutu Filozofii Uniwersytetu Carnegie-Mellon w Pittsburghu kierowanego przez Clarka Glymoura. Na jego ręce składam podziękowanie za wiele po¬mocnych uwag do moich wy¬stąpień oraz tekstów i za dyskusje przede wszystkim z nim samym i z jego najbliższymi współpracownikami: Peterem Spirtesem oraz Richardem Scheinesem, a także pozostałymi członkami tego zes¬połu, doktorantami i uczestnikami seminarium badawczego „Causality in the Social Sciences”. Za wieloletnie wsparcie, wielopłaszczyznowe inspiracje towarzyszące pi¬saniu tej książki, a także liczne pomocne uwagi do jej wcześniejszych wersji dziękuję przede wszystkim Księdzu Profesorowi Andrzejowi Bronkowi oraz Księdzu Profesorowi Józefowi Herbutowi, współprowadzącemu seminarium doktorskie w Katedrze Metodologii Nauk Katolickiego Uniwersytetu Lubel¬skiego im. Jana Pawła II, jak również pozostałym uczestnikom tego semina¬rium. Dziękuję mojej Żonie, dr Annie Kawalec za wiele wysiłku włożonego w ulepszenie redakcji – językowej i merytorycznej – obecnej książki. Książkę tę można czytać na kilka sposobów. Czytelnikom zainteresowa¬nym przede wszystkim prowadzeniem badań empirycznych polecałbym rozpoczęcie od Rozdziału 2. i kontynuację pozostałych rozdziałów Części I, a następnie Dodatków. Czytelnikom zainteresowanym problemami filozo¬fii i metodologii nauk polecałbym rozpoczęcie lektury książki od Części II i uzupełniającą lekturę Rozdziału 2., a następnie Wprowadzenia i Zakończenia. Czytelnikom mniej zainteresowanym zagadnieniami teoretycznymi pole¬całbym zapoznanie się z fascynującymi dziejami odkrycia przyczyn cholery przez Johna Snowa, które rekonstruuję w Rozdziale 1. W dalszej części nato¬miast polecałbym przejście do Wprowadzenia i Zakończenia, które w mniej specjalistyczny sposób przybliżają proponowane tu rozstrzygnięcia. Tekst książki nie był dotąd publikowany. Wyjątkiem są pewne fragmenty Rozdziału 8. oraz 9., które w zmienionej postaci ukazały się w Rocznikach Filozoficznych (Kawalec 2004). -/- Lublin, luty 2006 r. (shrink)

‘Bayesian epistemology’ became an epistemological movement in the 20th century, though its two main features can be traced back to the eponymous Reverend Thomas Bayes (c. 1701-61). Those two features are: (1) the introduction of a formal apparatus for inductive logic; (2) the introduction of a pragmatic self-defeat test (as illustrated by Dutch Book Arguments) for epistemic rationality as a way of extending the justification of the laws of deductive logic to include a justification for the laws of inductive logic. (...) The formal apparatus itself has two main elements: the use of the laws of probability as coherence constraints on rational degrees of belief (or degrees of confidence) and the introduction of a rule of probabilistic inference, a rule or principle of conditionalization. (shrink)

This thesis has two goals. Firstly, we consider the problem of model selection for the purposes of prediction. In modern science predictive mathematical models are ubiquitous and can be found in such diverse fields as weather forecasting, economics, ecology, mathematical psychology, sociology, etc. It is often the case that for a given domain of inquiry there are several plausible models, and the issue then is how to discriminate between them – this is the problem of model selection. We consider approaches (...) to model selection that are used in classical [also known as frequentist] statistics, and fashionable in recent years methods of Akaike Information Criterion [AIC] and Bayes Information Criterion [BIC], the latter being a part of a broader Bayesian approach. We show the connection between AIC and BIC, and provide comparison of performance of these methods. Secondly, we consider some philosophical arguments that arise within the setting of the model selection approaches investigated in the first part. These arguments aim to provide counterexamples to the epistemic thesis of scientific realism, viz., that predictively successful scientific theories are approximately true, and to the idea that truth and predictive accuracy go together. We argue for the following claims: 1) that none of the criticisms brought forward in the philosophical literature against the AIC methodology are devastating, and AIC remains a viable method of model selection; 2) that the BIC methodology likewise survives the numerous criticisms; 3) that the counterexamples to scientific realism that ostensibly arise within the framework of model selection are flawed; 4) that in general the model selection methods discussed in this thesis are neutral with regards to the issue of scientific realism; 5) that a plurality of methodologies should be applied to the problem of model selection with full awareness of the foundational issues that each of these methodologies has. (shrink)

Handbook of the History of Logic, vol. 10, eds. Dov Gabbay, Stephan Hartmann, and John Woods, forthcoming.

Proponents of Bayesian confirmation theory believe that they have the solution to a significant, recalcitrant problem in philosophy of science. It is the identification of the logic that governs evidence and its inductive bearing in science. That is the logic that lets us say that our catalog of planetary observations strongly confirms Copernicus’ heliocentric hypothesis; or that the fossil record is good evidence for the theory of evolution; or that the 3oK cosmic background radiation supports big bang cosmology. The definitive (...) solution to this problem would be a significant achievement. The problem is of central importance to philosophy of science, for, in the end, what distinguishes science from myth making is that we have good evidence for the content of science, or at least of mature sciences, whereas myths are evidentially ungrounded fictions. The core ideas shared by all versions of Bayesian confirmation theory are, at a good first approximation, that a scientist’s beliefs are or should conform to a probability measure; and that the incorporation of new evidence is through conditionalization using Bayes’ theorem. While the burden of this chapter will be to inventory why critics believe this theory may not be the solution after all, it is worthwhile first to summarize here the most appealing virtues of this simple account. There are three. First, the theory reduces the often nebulous notion of a logic of.. (shrink)

I consider whether evolutionary explanations can debunk our moral beliefs. Most contemporary discussion in this area is centred on the question of whether debunking implications follow from our ability to explain elements of human morality in terms of natural selection, given that there has been no selection for true moral beliefs. By considering the most prominent arguments in the literature today, I offer reasons to think that debunking arguments of this kind fail. However, I argue that a successful evolutionary debunking (...) argument can be constructed by appeal to the suggestion that our moral outlook reflects arbitrary contingencies of our phylogeny, much as the horizontal orientation of the whale’s tail reflects its descent from terrestrial quadrupeds. An introductory chapter unpacks the question of whether evolutionary explanations can debunk our moral beliefs, offers a brief historical guide to the philosophical discussion surrounding it, and explains what I mean to contribute to this discussion. Thereafter follow six chapters and a conclusion. The six chapters are divided into three pairs. The first two chapters consider what contemporary scientific evidence can tell us about the evolutionary origins of morality and, in particular, to what extent the evidence speaks in favour of the claims on which debunking arguments rely. The next two chapters offer a critique of popular debunking arguments that are centred on the irrelevance of moral facts in natural selection explanations. The final chapters develop a novel argument for the claim that evolutionary explanations can undermine our moral beliefs insofar as they show that our moral outlook reflects arbitrary contingencies of our phylogeny. A conclusion summarizes my argument and sets out the key questions that arise in its wake. (shrink)

In standard probability theory, probability zero is not the same as impossibility. But many have suggested that only impossible events should have probability zero. This can be arranged if we allow infinitesimal probabilities, but infinitesimals do not solve all of the problems. We will see that regular probabilities are not invariant over rigid transformations, even for simple, bounded, countable, constructive, and disjoint sets. Hence, regular chances cannot be determined by space-time invariant physical laws, and regular credences cannot satisfy seemingly reasonable (...) symmetry principles. Moreover, the examples here are immune to the objections against Williamson’s infinite coin flips. (shrink)

A discussion of L.A. Paul's 'Transformative Experience' from an Author Meets Critics session at the 2015 Pacific APA.