This work has been selected by scholars as being culturally important and is part of the knowledge base of civilization as we know it. This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity has a copyright on the body of the work. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and (...) made generally available to the public. To ensure a quality reading experience, this work has been proofread and republished using a format that seamlessly blends the original graphical elements with text in an easy-to-read typeface. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant. (shrink)

A bounded formula is a pair consisting of a propositional formula φ in the first coordinate and a real number within the unit interval in the second coordinate, interpreted to express the lower-bound probability of φ. Converting conjunctive/disjunctive combinations of bounded formulas to a single bounded formula consisting of the conjunction/disjunction of the propositions occurring in the collection along with a newly calculated lower probability is called absorption. This paper introduces two inference rules for effecting conjunctive and disjunctive absorption and (...) compares the resulting logical system, called System Y, to axiom System P. Finally, we demonstrate how absorption resolves the lottery paradox and the paradox of the preference. (shrink)

Carnap's Inductive Logic, like most philosophical discussions of induction, is designed for the case of independent trials. To take account of periodicities, and more generally of order, the account must be extended. From both a physical and a probabilistic point of view, the first and fundamental step is to extend Carnap's inductive logic to the case of finite Markov chains. Kuipers (1988) and Martin (1967) suggest a natural way in which this can be done. The probabilistic character of Carnapian inductive (...) logic(s) for Markov chains and their relationship to Carnap's inductive logic(s) is discussed at various levels of Bayesian analysis. (shrink)

This paper concerns exchangeable analogical predictions based on similarity relations between predicates, and deals with a restricted class of such relations. It describes a system of Carnapian λγ rules on underlying predicate families to model the analogical predictions for this restricted class. Instead of the usual axiomatic definition, the system is characterized with a Bayesian model that employs certain statistical hypotheses. Finally the paper argues that the Bayesian model can be generalized to cover cases outside the restricted class of similarity (...) relations. (shrink)

We give an account of some relationships between the principles of Constant and Atom Exchangeability and various generalizations of the Principle of Instantial Relevance within the framework of Inductive Logic. In particular we demonstrate some surprising and somewhat counterintuitive dependencies of these relationships on ostensibly unimportant parameters, such as the number of predicates in the overlying language.

Let R(X, B) denote the class of probability functions that are defined on algebra X and that represent rationally permissible degrees of certainty for a person whose total relevant background evidence is B. This paper is concerned with characterizing R(X, B) for the case in whichX is an algebra of propositions involving two properties and B is empty. It proposes necessary conditions for a probability function to be in R(X, B), some of which involve the notion of statistical dependence. The (...) class of probability functions that satisfy these conditions, here denoted PI, includes a class that Carnap once proposed for the same situation. Probability functions in PI violate Carnap's axiom of analogy but, it is argued, that axiom should be rejected. A derivation of Carnap's model by Hesse has limitations that are not present in the derivation of PI given here. Various alternative probability models are considered and rejected. (shrink)

This major work challenges some widely held positions in epistemology - those of Peirce and Popper on the one hand and those of Quine and Kuhn on the other.

At least one of these conceptions of probability underlies any theory of statistical inference (or, to use Neyman's phrase, 'inductive behavior'). ...

Additionally, the text shows how to develop computationally feasible methods to mesh with this framework.

An important problem in inductive probability theory is the design of exchangeable analogical methods, i.e., of exchangeable inductive methods that take into account certain considerations of analogy by similarity for predictive inferences. Here a precise reformulation of the problem of predictive analogy is given and a new family of exchangeable analogical methods is introduced.Firstly, it is proved that the exchangeable analogical method introduced by Skyrms (1993) does not satisfy the best known general principles of predictive analogy. Secondly, Skyrms's approach — (...) consisting of the usage of particular hyper-Carnapian methods, i.e., mixtures of Carnapian inductive methods — is adopted in the design of a new family of exchangeable analogical methods. Lastly, it is proved that such methods satisfy an interesting general principle of predictive analogy. (shrink)

The Lottery Paradox and the Preface Paradox both involve the thesis that high probability is sufficient for rational acceptability. The standard solution to these paradoxes denies that rational acceptability is deductively closed. This solution has a number of untoward consequences. The present paper suggests that a better solution to the paradoxes is to replace the thesis that high probability suffices for rational acceptability with a somewhat stricter thesis. This avoids the untoward consequences of the standard solution. The new solution will (...) be defended against a seemingly obvious objection. 1 The paradoxes of rational acceptability 2 The standard solution 3 A new solution to the paradoxes 4 Basic assumptions 5 The new solution defended 6 Conclusion 7 Appendix. (shrink)

One of Ian Hacking's earliest publications, this book showcases his early ideas on the central concepts and questions surrounding statistical reasoning. He explores the basic principles of statistical reasoning and tests them, both at a philosophical level and in terms of their practical consequences for statisticians. Presented in a fresh twenty-first-century series livery, and including a specially commissioned preface written by Jan-Willem Romeijn, illuminating its enduring importance and relevance to philosophical enquiry, Hacking's influential and original work has been revived for (...) a new generation of readers. (shrink)

Probability and inverse inference; Neyman-Pearson theory; Fisherian significance testing; The fiducial argument: one parameter; The fiducial argument: several parameters; Ian hacking's theory; Henry Kyburg's theory; Relevance and experimental design.

According to the Bayesian view, scientific hypotheses must be appraised in terms of their posterior probabilities relative to the available experimental data. Such posterior probabilities are derived from the prior probabilities of the hypotheses by applying Bayes'theorem. One of the most important problems arising within the Bayesian approach to scientific methodology is the choice of prior probabilities. Here this problem is considered in detail w.r.t. two applications of the Bayesian approach: (1) the theory of inductive probabilities (TIP) developed by Rudolf (...) Carnap and other epistomologists and (2) the analysis of the multinational inferences provided by Bayesian statstics (BS). ... Zie: Summary. (shrink)

While in principle probabilistic logics might be applied to solve a range of problems, in practice they are rarely applied at present. This is perhaps because they seem disparate, complicated, and computationally intractable. However, we shall argue in this programmatic paper that several approaches to probabilistic logic into a simple unifying framework: logically complex evidence can be used to associate probability intervals or probabilities with sentences.