It is natural and important to have a formal representation of plain belief, according to which propositions are held true, or held false, or neither. (In the paper this is called a deterministic representation of epistemic states). And it is of great philosophical importance to have a dynamic account of plain belief. AGM belief revision theory seems to provide such an account, but it founders at the problem of iterated belief revision, since it can generally account only for one step (...) of revision. The paper discusses and rejects two solutions within the confines of AGM theory. It then introduces ranking functions (as I prefer to call them now; in the paper they are still called ordinal conditional functions) as the proper (and, I find, still the best) solution of the problem, proves that conditional independence w.r.t. ranking functions satisfies the so-called graphoid axioms, and proposes general rules of belief change (in close analogy to Jeffrey's generalized probabilistic conditionalization) that encompass revision and contraction as conceived in AGM theory. Indeed, the parallel to probability theory is amazing. Probability theory can profit from ranking theory as well since it is also plagued by the problem of iterated belief revision even if probability measures are conceived as Popper measures (see No. 11). Finally, the theory is compared with predecessors which are numerous and impressive, but somehow failed to explain the all-important conditional ranks in the appropriate way. (shrink)

The significance of the plurality of the Copernican Revolution is the main thrust of this undergraduate text In this study of the Copernican Revolution, the ...

Scientific reasoning is—and ought to be—conducted in accordance with the axioms of probability. This Bayesian view—so called because of the central role it accords to a theorem first proved by Thomas Bayes in the late eighteenth ...

During the last three decades, reflections on the growth of scientific knowledge have inspired historians, sociologists, and some philosophers to contend that scientific objectivity is a myth. In this book, Kitcher attempts to resurrect the notions of objectivity and progress in science by identifying both the limitations of idealized treatments of growth of knowledge and the overreactions to philosophical idealizations. Recognizing that science is done not by logically omniscient subjects working in isolation, but by people with a variety of personal (...) and social interests, who cooperate and compete with one another, he argues that, nonetheless, we may conceive the growth of science as a process in which both our vision of nature and our ways of learning more about nature improve. Offering a detailed picture of the advancement of science, he sets a new agenda for the philosophy of science and for other "science studies" disciplines. (shrink)

In his new foreword to this edition, Hilary Putnam forcefully rejects these nativist claims.

Reichenbach sought to resolve Hume's problem of the justification of induction by means of a pragmatic vindication that relies heavily on the convergence properties of his rule of induction. His attempt to rule out all other asymptotic methods by an appeal to descriptive simplicity was unavailing. We found that important progress in that direction could be made by invoking normalizing conditions (consistency) and methodological simplicity (as a basis for invariance), but that they did not do the whole job. I am (...) proposing that, in the end, Reichenbach's own distinction between discovery and justification holds the key to the solution. (shrink)

Subjective Bayesians typically find the following objection difficult to answer: some joint probability measures lead to intuitively irrational inductive behavior, even in the long run. Yet well-motivated ways to restrict the set of reasonable prior joint measures have not been forthcoming. In this paper I propose a way to restrict the set of prior joint probability measures in particular inductive settings. My proposal is the following: where there exists some successful inductive method for getting to the truth in some situation, (...) we ought to employ a (joint) probability measure that is inductively successful in that situation, if such a measure exists. In order to do show that the restriction is possible to meet in a broad class of cases, I prove a Bayesian Completeness Theorem, which says that for any solvable inductive problem of a certain broad type, there exist probability measures that a Bayesian could use to solve the problem. I then briefly compare the merits of my proposal with two other well-known proposals for constraining the class of admissible subjective probability measures, the leave the door ajar condition and the maximize entropy condition. (shrink)

This paper pursues a thorough-going instrumentalist, or means-ends, approach to the theory of inductive inference. I consider three epistemic aims: convergence to a correct theory, fast convergence to a correct theory and steady convergence to a correct theory (avoiding retractions). For each of these, two questions arise: (1) What is the structure of inductive problems in which these aims are feasible? (2) When feasible, what are the inference methods that attain them? Formal learning theory provides the tools for a complete (...) set of answers to these questions. As an illustration of the results, I apply means-ends analysis to various versions of Goodman's Riddle of Induction. (shrink)

This paper places formal learning theory in a broader philosophical context and provides a glimpse of what the philosophy of induction looks like from a learning-theoretic point of view. Formal learning theory is compared with other standard approaches to the philosophy of induction. Thereafter, we present some results and examples indicating its unique character and philosophical interest, with special attention to its unified perspective on inductive uncertainty and uncomputability.

In this paper, I present a simple and straightforward logic of induction: a consequence relation characterized by a proof theory and a semantics. This system will be called LI. The premises will be restricted to, on the one hand, a set of empirical data and, on the other hand, a set of background generalizations. Among the consequences will be generalizations as well as singular statements, some of which may serve as predictions and explanations.

Contemporary cognitive neuropsychology attempts to infer unobserved features of normal human cognition, or ‘cognitive architecture’, from experiments with normals and with brain-damaged subjects in whom certain normal cognitive capacities are altered, diminished, or absent. Fundamental methodological issues about the enterprise of cognitive neuropsychology concern the characterization of methods by which features of normal cognitive architecture can be identified from such data, the assumptions upon which the reliability of such methods are premised, and the limits of such methods—even granting their assumptions—in (...) resolving uncertainties about that architecture. With some idealization, the question of the capacities of various experimental designs in cognitive neuropsychology to uncover cognitive architecture can be reduced to comparatively simple questions about the prior assumptions investigators are willing to make. This paper presents some of simplest of those reductions. (shrink)

Not since Ernest Nagel’s 1939 monograph on the theory of probability has there been a comprehensive elementary survey of the philosophical problems of probablity and induction. This is an authoritative and up-to-date treatment of the subject, and yet it is relatively brief and nontechnical. Hume’s skeptical arguments regarding the justification of induction are taken as a point of departure, and a variety of traditional and contemporary ways of dealing with this problem are considered. The author then sets forth his own (...) criteria of adequacy for interpretations of probability. Utilizing these criteria he analyzes contemporary theories of probability, as well as the older classical and subjective interpretations. (shrink)

From one perspective, the fundamental notions of point-set topology have to do with sequences and their limits. A broad class of epistemological questions also appear to be concerned with sequences and their limits. For example, problems of empirical underdetermination—which of a collection of alternative theories is true—have to do with logical properties of sequences of evidence. Underdetermination by evidence is the central problem of Plato’s Meno, of one of Sextus Empiricus’ many skeptical doubts, and arguably it is the idea at (...) work in Kant’s antinomies, for example in his account of the infinite divisibility of matter. Many questions of methodology, or of the logic of discovery, have to do with sequences and their limits. For example, under what conditions do Bayesian procedures, which put a prior probability distribution over alternative hypotheses and possible evidence and form conditional probabilities as new evidence is obtained, converge to the truth? Some analyses of “S knows that p” seem to appeal to properties of actual and possible sequences of something—for example Nozick’s proposal that knowledge of p is belief in p produced by a method that would not produce belief in p if p were false and would produce belief in p if p were true. Even questions about finding the truth under a quite radical relativism, in which truth depends on conceptual scheme and conceptual schemes can be altered, have been analyzed as a kind of limiting property of sequences. (shrink)

Hans Reichenbach made a bold and original attempt to ‘vindicate’ induction. He proposed a rule, the ‘straight rule’ of induction, which would guarantee inductive success if any rule of induction would. A central problem facing his attempt to vindicate the straight rule is that too many other rules are just as good as the straight rule if our only constraint on what counts as ‘success’ for an inductive rule is that it is ‘asymptotic’, i.e. that it converges in the limit (...) to the true limiting frequency (of some type of outcome O in a sequence of events) whenever such a limiting frequency exists. In this paper I consider the consequences of requiring speed-optimality of asymptotic methods, that is, requiring that inductive methods must get to the truth as quickly as possible. Two main results are proved: (1) the straight rule is speed-optimal; (2) there are (uncountably) many non-speed-optimal asymptotic methods. A further result gives a sufficient but not necessary condition for speed-optimality among asymptotic methods. Some consequences and open questions are then discussed. (shrink)

The aim of cognitive neuropsychology is to articulate the functional architecture underlying normal cognition, on the basis of congnitive performance data involving brain-damaged subjects. Throughout the history of the subject, questions have been raised as to whether the methods of neuropsychology are adequate to its goals. The question has been reopened by Glymour [1994], who formulates a discovery problem for cognitive neuropsychology, in the sense of formal learning theory, concerning the existence of a reliable methodology. It appears that the discovery (...) problem may be insoluble in principle! I propose a modified formulation of Glymour's discovery problem and argue that a sceptical conclusion about the possiblity of cognitive neuropsychology as an empirical science is not warranted. (shrink)

Kevin T. Kelly, Cory Juhl and Clark Glymour. Reliability, Realism, and Relativism.