We face reality presented with the data of conscious experience and nothing else. The project of early modern philosophy was to build a complete theory of the world from this starting point, with no cheating. Crucial to this starting point is the data of conscious sensory experience – sense data. Attempts to avoid this project often argue that the very idea of sense data is confused. But the sense-data way of talking, the sense-data language, can be freed from every blemish (...) using ideas from contemporary metaontology. We can adopt a sense-data framework that vindicates the traditional claims of sense-data theories and leads to plausible theories of perception and color. We can, we should, and in a sense, we must. Yet when we do, we face the traditional problem of external world skepticism, head-on. The real challenge of skepticism is forced upon us; it cannot honestly be avoided using externalist tricks, burden of proof shifting, or other razzle dazzle. But the challenge can be met: we are rational to posit the external world as the best explanation of the many synchronic and diachronic patterns over our sense-data. This paper argues for all of these points and ends with a plea for analytic empiricism – a traditional sense-data version of empiricism that uses all of the tools of analytic philosophy while avoiding the more questionable doctrines of the Vienna Circle (phenomenalism, verificationism). Analytic empiricism is our last best hope for completing the great philosophical project of early modern philosophy. (shrink)

The extensions of Goodman’s ‘grue’ predicate and Kripke’s ‘quus’ are constructed from the extensions of more familiar terms via a reinterpretation that permutes assignments of reference. Since this manoeuvre is at the heart of Putnam’s model-theoretic and permutation arguments against metaphysical realism (‘Putnam’s Paradox’), both Goodman’s New Riddle of Induction and the paradox about meaning that Kripke attributes to Wittgenstein are instances of Putnam’s. Evidence cannot selectively confirm the green-hypothesis and disconfirm the grue-hypothesis, because the theory of which the green-hypothesis (...) is a part has an unintended model in which the grue-hypothesis is equally confirmed; and there are no meaning-facts that determine reference, because the objects referred to by the referring terms of any language or set of intentional mental states are permutable in a way that is consistent with the truth-values of all other sentences in that language or beliefs in that set. The upshot is that the three paradoxes need to be solved in a unified way. (shrink)

This paper is concerned with two concepts of qualitativeness that apply to intensional entities. I propose an account of pure qualitativeness that largely follows the traditional understanding established by Carnap, and try to shed light on its ontological presuppositions. On this account, an intensional entity is purely qualitative iff it does not ‘involve’ any particular. An alternative notion of qualitativeness—which I propose to refer to as a concept of strict qualitativeness—has recently been introduced by Chad Carmichael. However, Carmichael’s definition presupposes (...) a highly fine-grained conception of properties and relations. To eliminate this presupposition, I tentatively suggest a different definition that rests on a concept of perspicuous denotation. In the penultimate section, both concepts of qualitativeness are put to work in distinguishing between different ‘grades’ of qualitative discriminability. (shrink)

Computational complexity is a discipline of computer science and mathematics which classifies computational problems depending on their inherent difficulty, i.e. categorizes algorithms according to their performance, and relates these classes to each other. P problems are a class of computational problems that can be solved in polynomial time using a deterministic Turing machine while solutions to NP problems can be verified in polynomial time, but we still do not know whether they can be solved in polynomial time as well. A (...) solution for the so-called NP-complete problems will also be a solution for any other such problems. Its artificial-intelligence analogue is the class of AI-complete problems, for which a complete mathematical formalization still does not exist. In this chapter we will focus on analysing computational classes to better understand possible formalizations of AI-complete problems, and to see whether a universal algorithm, such as a Turing test, could exist for all AI-complete problems. In order to better observe how modern computer science tries to deal with computational complexity issues, we present several different deep-learning strategies involving optimization methods to see that the inability to exactly solve a problem from a higher order computational class does not mean there is not a satisfactory solution using state-of-the-art machine-learning techniques. Such methods are compared to philosophical issues and psychological research regarding human abilities of solving analogous NP-complete problems, to fortify the claim that we do not need to have an exact and correct way of solving AI-complete problems to nevertheless possibly achieve the notion of strong AI. (shrink)

Putnam construed the aim of Carnap’s program of inductive logic as the specification of a “universal learning machine,” and presented a diagonal proof against the very possibility of such a thing. Yet the ideas of Solomonoff and Levin lead to a mathematical foundation of precisely those aspects of Carnap’s program that Putnam took issue with, and in particular, resurrect the notion of a universal mechanical rule for induction. In this paper, I take up the question whether the Solomonoff–Levin proposal is (...) successful in this respect. I expose the general strategy to evade Putnam’s argument, leading to a broader discussion of the outer limits of mechanized induction. I argue that this strategy ultimately still succumbs to diagonalization, reinforcing Putnam’s impossibility claim. (shrink)

This is part II in a series of papers outlining Abstraction Theory, a theory that I propose provides a solution to the characterisation or epistemological problem of induction. Logic is built from first principles severed from language such that there is one universal logic independent of specific logical languages. A theory of (non-linguistic) meaning is developed which provides the basis for the dissolution of the `grue' problem and problems of the non-uniqueness of probabilities in inductive logics. The problem of counterfactual (...) conditionals is generalised to a problem of truth conditions of hypotheses and this general problem is then solved by the notion of abstractions. The probability calculus is developed with examples given. In future parts of the series the full decision theory is developed and its properties explored. (shrink)

Freitag (2015) and Schramm (2014) have proposed different, although converging, solutions of Goodman’s New Riddle of Induction. Answering their proposals, Dorst (2016 and 2018) has used the fictitious character of a ‘grue-speaker’ as his principal device for criticizing counterfactual-based treatments of the Riddle. In this paper, I argue that Dorst’s arguments fail: On the observation of no other than green emeralds, the ‘grue-speaker’ cannot use the symmetry between the ‘green’- and ‘grue’-languages for claiming ‘grue’- instead of ‘green’-evidence, and the counterfactuals (...) involved (explicitly by Schramm and implicitly by Freitag) remain unaffected by Dorst’s proposal for how to evaluate them. (shrink)

A logical empiricist “baseline statement” can formalize some propositions established by a body of evidence or set of observations. However, it may not necessarily capture, of two propositions it entails, whether all the subsets of the evidence that establish one proposition also establish the other, vice versa, or neither. Yet, according to this paper, which obtains should sometimes matter for confirmation. It illustrates by showing how this “evidential dependence” can be used to address problems with generalizations of grue-like predicates, and (...) do so still within a very simple broadly Hempelian framework. (shrink)

There appears to be a widespread belief that the social sciences during the 1950s and 1960s can be characterized by an almost unquestioned faith in a positivist philosophy of science. In contrast, the article shows that even within the narrower segment of Cold War social science, positivism was not an unquestioned doctrine blindly followed by everybody, but that quite divergent views coexisted. The article analyses two ‘techniques of prospection’, the Delphi technique and political gaming, from the perspective of a comprehensive (...) set of ideas attributed to ‘positivism’. Both techniques were developed in the early 1950s by researchers at the RAND Corporation, a Californian think tank with tight relations to the US Air Force. Despite the closeness of origin, the two techniques show considerable differences in their basic epistemologies. The article thus concludes that more important than positivism in uniting US Cold War social science was the shared sense of urgency and of the potential of social science to put decision-making in foreign policy on a rational basis. In this sense, as far as the Cold War social sciences were of a piece, they were made so by the sense of danger and urgency of action evoked by the image of the Iron Curtain. (shrink)

The thesis of this paper is that we can justify induction deductively relative to one end, and deduction inductively relative to a different end. I will begin by presenting a contemporary variant of Hume ’s argument for the thesis that we cannot justify the principle of induction. Then I will criticize the responses the resulting problem of induction has received by Carnap and Goodman, as well as praise Reichenbach ’s approach. Some of these authors compare induction to deduction. Haack compares (...) deduction to induction, and I will critically discuss her argument for the thesis that we cannot justify the principles of deduction next. In concluding I will defend the thesis that we can justify induction deductively relative to one end, and deduction inductively relative to a different end, and that we can do so in a non-circular way. Along the way I will show how we can understand deductive and inductive logic as normative theories, and I will briefly sketch an argument to the effect that there are only hypothetical, but no categorical imperatives. (shrink)

We characterize those identities and independencies which hold for all probability functions on a unary language satisfying the Principle of Atom Exchangeability. We then show that if this is strengthen to the requirement that Johnson's Sufficientness Principle holds, thus giving Carnap's Continuum of inductive methods for languages with at least two predicates, then new and somewhat inexplicable identities and independencies emerge, the latter even in the case of Carnap's Continuum for the language with just a single predicate.

As I head home from work, I’m not sure whether my daughter’s new bike is green, and I’m also not sure whether I’m on drugs that distort my color perception. One thing that I am sure about is that my attitudes towards those possibilities are evidentially independent of one another, in the sense that changing my confidence in one shouldn’t affect my confidence in the other. When I get home and see the bike it looks green, so I increase my (...) confidence that it is green. But something else has changed: now an increase in my confidence that I’m on color-drugs would undermine my confidence that the bike is green. Jonathan Weisberg and Jim Pryor argue that the preceding story is problematic for standard Bayesian accounts of perceptual learning. Due to the ‘rigidity’ of Conditionalization, a negative probabilistic correlation between two propositions cannot be introduced by updating on one of them. Hence if my beliefs about my own color-sobriety start out independent of my beliefs about the color of the bike, then they must remain independent after I have my perceptual experience and update accordingly. Weisberg takes this to be a reason to reject Conditionalization. I argue that this conclusion is too pessimistic: Conditionalization is only part of the Bayesian story of perceptual learning, and the other part needn’t preserve independence. Hence Bayesian accounts of perceptual learning are perfectly consistent with potential underminers for perceptual beliefs. (shrink)

My dissertation explores the ways in which Rudolf Carnap sought to make philosophy scientific by further developing recent interpretive efforts to explain Carnap’s mature philosophical work as a form of engineering. It does this by looking in detail at his philosophical practice in his most sustained mature project, his work on pure and applied inductive logic. I, first, specify the sort of engineering Carnap is engaged in as involving an engineering design problem and then draw out the complications of design (...) problems from current work in history of engineering and technology studies. I then model Carnap’s practice based on those lessons and uncover ways in which Carnap’s technical work in inductive logic takes some of these lessons on board. This shows ways in which Carnap’s philosophical project subtly changes right through his late work on induction, providing an important corrective to interpretations that ignore the work on inductive logic. Specifically, I show that paying attention to the historical details of Carnap’s attempt to apply his work in inductive logic to decision theory and theoretical statistics in the 1950s and 1960s helps us understand how Carnap develops and rearticulates the philosophical point of the practical/theoretical distinction in his late work, offering thus a new interpretation of Carnap’s technical work within the broader context of philosophy of science and analytical philosophy in general. (shrink)

Israel 2004 claims that numerous philosophers have misinterpreted Goodman’s original ‘New Riddle of Induction’, and weakened it in the process, because they do not define ‘grue’ as referring to past observations. Both claims are false: Goodman clearly took the riddle to concern the maximally general problem of “projecting” any type of characteristic from a given realm of objects into another, and since this problem subsumes Israel’s, Goodman formulated a stronger philosophical challenge than the latter surmises.

Begins by explaining then proving a generalized language dependence result similar to Goodman's "grue" problem. I then use this result to cast doubt on the existence of an objective evidential favoring relation (such as "the evidence confirms one hypothesis over another," "the evidence provides more reason to believe one hypothesis over the other," "the evidence justifies one hypothesis over the other," etc.). Once we understand what language dependence tells us about evidential favoring, our options are an implausibly strong conception of (...) the a priori, a hard externalism on which agents are unable to determine what their evidence favors, or a subjectivist view that makes evidential favoring relative to features of the agent. (shrink)

The most innovative and important parts of Bertrand Russell's Human Knowledge were the result of his first attempt in three decades to come to grips with the problem of induction, or, more generally, ‘non-demonstrative inference’. My purpose here is to argue that that work constituted giant progress on the problem; if I succeed, something will have been done to restore this work to its proper place in the history of philosophy and, correlatively, to rearrange that history.

To explain the phenomena in the world of our experience, to answer the question “why?” rather than only the question “what?”, is one of the foremost objectives of all rational inquiry; and especially, scientific research in its various branches strives to go beyond a mere description of its subject matter by providing an explanation of the phenomena it investigates. While there is rather general agreement about this chief objective of science, there exists considerable difference of opinion as to the function (...) and the essential characteristics of scientific explanation. In the present essay, an attempt will be made to shed some light on these issues by means of an elementary survey of the basic pattern of scientific explanation and a subsequent more rigorous analysis of the concept of law and of the logical structure of explanatory arguments. (shrink)

The paper presents a comprehensive solution to the new riddle of induction. Gruesome induction is blocked because “grue” is not independent of our sampling and observation methods. Before presenting my theory, I critically survey previous versions of what I call the “independence strategy”, tracing the strategy to three different papers from the 1970s by (respectively) Wilkerson, Moreland, and Jackson. Next I critically examine recent approaches by Okasha, Godfrey-Smith, Schramm, and Freitag. All of these approaches have their virtues, but none of (...) them rules out every problem case. Nor do any of them alone explain exactly what goes wrong in all types of gruesome reasoning. My account aims to do both. Learning lessons from my criticisms of previous theories, I argue that there are several crucial types of independence. All of them are needed to rule out every problem case. I close by suggesting that the independence solution can also be adopted by proponents of other approaches—Bayesians, fans of natural kinds, and pragmatists. (shrink)

A core, constitutive norm of science is to remove or remedy the artefacts in one’s data. Here, we consider examples of artefacts from many fields of science (for example, astronomy, economics, electrophysiology, psychology, and systems neuroscience) and discuss their contribution to a more general evidential selection problem at the heart of the epistemology of evidence. Synthesizing and building on previously disparate discussions in many areas of the philosophy of science, we provide a novel, causal–pragmatic account that fits the examples and (...) clarifies the practices by which artefacts are discovered and remedied. (shrink)

Yehezkel presents an interesting argument to resolve Goodman’s New Riddle of Induction, and in effect to claim that a purely syntactical theory of confirmation is possible. In this paper I suggest that Yehezkel’s argument relies on two premises not proven in his paper. The first premise is that if “a New Riddle of Deduction” can be formulated then there is no New Riddle of Induction. This premise seems to be wrong as I claim in part 2 of this paper. The (...) second premise is that a New Riddle of Deduction can be formulated. Despite Yehezkel’s efforts to prove this claim, it seems to me false, or at least, unproven. I therefore conclude that there is no New Riddle of Deduction, and therefore, no actual resolution to the New Riddle of Induction. (shrink)

In the classical version of Goodman's Paradox, the universe where the problem takes place is ambiguous. The conditions of induction being accurately described, I define then a framework of n-universes, allowing the distinction, among the criteria of a given n-universe, between constants and variables. Within this framework, I distinguish between two versions of the problem, respectively taking place: in an n-universe the variables of which are colour and time; in an n-universe the variables of which are colour, time, and space. (...) Finally, I show that each of these versions admits a specific resolution. (shrink)

The paper explores the disjunctive riddle for induction: If we know the sample Ks to be P, we also know that they are P or F. Assuming that we also know that the future Ks are non-P, we can conclude that they are F, if only we can inductively infer the evidentially supported P-or-F hypothesis. Yet this is absurd. We cannot predict that future Ks are F based on the knowledge that the samples, and only they, are P. The ensuing (...) challenge is to account for the unprojectibility of the disjunctive hypothesis. I provide an explanation in terms of epistemic dependence. The P-or-F hypothesis is unprojectible because the evidence supporting it depends epistemically on the evidence for the defeated P-hypothesis. The paper also shows that the disjunctive riddle covers the essence of Goodman's infamous grue-problem, which, therefore, can be resolved by the same means: In contrast to the green-hypothesis, the grue-hypothesis is unprojectible because the grue-evidence depends on the evidence for a defeated hypothesis. (shrink)

Nelson Goodman's new riddle of induction forcefully illustrates a challenge that must be confronted by any adequate theory of inductive inference: provide some basis for choosing among alternative hypotheses that fit past data but make divergent predictions. One response to this challenge is to distinguish among alternatives by means of some epistemically significant characteristic beyond fit with the data. Statistical learning theory takes this approach by showing how a concept similar to Popper's notion of degrees of testability is linked to (...) minimizing expected predictive error. In contrast, formal learning theory appeals to Ockham's razor, which it justifies by reference to the goal of enhancing efficient convergence to the truth. In this essay, I show that, despite their differences, statistical and formal learning theory yield precisely the same result for a class of inductive problems that I call strongly VC ordered, of which Goodman's riddle is just one example. (shrink)

Collin Howson (2000) challenges van Cleve’s reliabilist defense of induction (1984) based on an adaptation of Goodman Paradox (or new riddle of induction). I will try to show that Howson’s argument does not succeed once it is self-defeating. Nevertheless, I point out another way which Howson could have employed the new riddle to undermine the reliabilist defense.

Many believe that Goodman’s new riddle of induction proves the impossibility of a purely syntactical theory of confirmation. After discussing and rejecting Jackson’s solution to Goodman’s paradox, I formulate the “new riddle of deduction,” in analogy to the new riddle of induction. Since it is generally agreed that deductive validity can be defined syntactically, the new riddle of induction equally does not show that inductive validity cannot be defined syntactically. I further rely on the analogy between induction and deduction in (...) order to explain why some predicates, such as “grue,” are unprojectible. (shrink)

The structure of Reichenbach's pragmatic vindication of induction is analysed in detail. The argument is seen to proceed in two stages, the first being a pragmatic justification of the frequency interpretation of probability which is taken as a license for considering the aim of induction to be the discovery of limiting relative frequencies, and the second being the pragmatic justification of induction itself. Both justifications are found to contain flaws, and the arguments used to support Reichenbach's definition of the aim (...) of induction presuppose the availability of a type of predicate which generates paradoxes closely related to Goodman's "grue-bleen" paradox. Next, Salmon's "Criterion of Linguistic Invariance" is evaluated as a canon of inductive logic, which singles out the "straight rule" from an infinite class of convergent inductive rules. Upon close examination, its credentials are seen to be unimpressive. In connection with Salmon's work on linguistic invariance, we take a closer look at the impact of the Goodman paradox on probability estimator rules like Reichenbach's "straight rule." We find that its undesirable consequences for such systems of inductive logic cannot be escaped by Salmon's solution, or indeed by any solution whose motivating idea is to rule "queer" predicates out of court. Finally, the discussion of the Goodman paradox leads us to a modest methodological proposal for systems of inductive logic which incorperate probability estimator rules of the type at issue. (shrink)

This essay demonstrates a previously unnoticed connection between formal and statistical learning theory with regard to Nelson Goodman’s new riddle of induction. Discussions of Goodman’s riddle in formal learning theory explain how conjecturing “all green” before “all grue” can enhance efficient convergence to the truth, where efficiency is understood in terms of minimizing the maximum number of retractions or “mind changes.” Vapnik-Chervonenkis (VC) dimension is a central concept in statistical learning theory and is similar to Popper’s notion of degrees of (...) testability. I show that for a class inductive problems of which Goodman’s riddle is one example, a reliable inductive method minimizes the maximum number of mind changes exactly if it always conjectures the hypothesis from the set with lowest VC dimension consistent with the data. I also discuss the relevance of these results to language invariance and curve fitting. (shrink)

1. Deductive and Inductive Inference. Within the traditional treatments of scientific method, e.g., in and, it was customary to divide scientific inference into two parts: deductive and inductive. Deductive inference was taken to mean the activity of deducing theorems from postulates and definitions, whereas inductive inference represented the activity of constructing a general statement from a set of particular “facts.” Deductive inference was relegated to the mathematical sciences, and inductive inference to the empirical sciences. As a consequence, the whole of (...) science was split into two quite distinct parts: deductive science was conceived to start with precise axioms, postulates, and definitions, and its method consisted in drawing inferences from these “givens” in such a way that if the original assumptions are taken as true, then the theorems must be taken as true also. The obligation behind this “must” of the mathematical sciences was an obligation based on strict rules of deductive inference; in the earlier analyses, it was supposed that these rules were all aspects of the general theory of the syllogism, as it was described in an almost complete form in but in later work the rules have been formalized in more general terms. Inductive inference, on the other hand, was supposed to start with observed facts; these facts, or “data,” were presumably given by the senses, and described particular aspects of the external world. If the facts were given in a certain way, then the empirical scientist could “infer” a generalized description; this generalization had the characteristic that if it were granted as true, then all the facts could be deduced as consequences. The inductive process admittedly does not lead to unique generalizations, and the philosopher of science searched for other defining characteristics of good inference, such as “simplicity” and “convenience.” These empirical generalizations were taken to be “descriptions of the phenomenal world of the scientist”; a further inductive step might be taken by constructing a set of very general principles out of the more specialized generalizations within specific research problems. These “higher” inductive inferences were regarded as “theories,” which could be studied by themselves within the method of deductive inference. The scientist was then described as “checking” theory by determining whether or not the predicted consequences deduced from theory actually hold in the phenomenal world. (shrink)

Games, Norms, and Reasons: Logic at the Crossroads provides an overview of modern logic focusing on its relationships with other disciplines, including new interfaces with rational choice theory, epistemology, game theory and informatics. This book continues a series called "Logic at the Crossroads" whose title reflects a view that the deep insights from the classical phase of mathematical logic can form a harmonious mixture with a new, more ambitious research agenda of understanding and enhancing human reasoning and intelligent interaction. The (...) editors have gathered together articles from active authors in this new area that explore dynamic logical aspects of norms, reasons, preferences and beliefs in human agency, human interaction and groups. The book pays a special tribute to Professor Rohit Parikh, a pioneer in this movement. (shrink)

The universal optimality theorem for metainduction works for epistemic agents faced with a choice among finitely many prediction methods. Eckhart Arnold and Tom Sterkenburg objected that it breaks...

We consider the problem of induction over languages containing binary relations and outline a way of interpreting and constructing a class of probability functions on the sentences of such a language. Some principles of inductive reasoning satisfied by these probability functions are discussed, leading in turn to a representation theorem for a more general class of probability functions satisfying these principles.

RÉSUMÉ : Depuis l’ouvrage classique de Goodman, on sait que toute théorie de l’induction doit comporter une composante non formelle. Or, la liberté théorique offerte par le recours à un tel élément implique des responsabilités. Cet article propose comme desideratum d’une théorie de l’induction qu’elle rende compte de la dynamique de sa composante non formelle. Ce desideratum, qui est nouveau, n’est pas satisfait par les principales théories existantes de l’induction. L’identification de l’importance de la dynamique a pourtant l’avantage de suggérer (...) une voie vers une théorie plus acceptable et plus compléte de l’induction. ABSTRACT: Since Goodman’s classic monograph, it has been known that any reasonable theory of induction must involve non formal elements. However, the right to make theoretical use of such an element comes with responsibilities. This article argues for an apparently new desideratum for a theory of induction: namely, that it accounts for the dynamics of the non formal element used. None of the main existing theories of induction satisfies this desideratum. The recognition of the importance of dynamics does however have the advantage of suggesting where to look for a more acceptable and complete theory of induction. (shrink)

This paper attempts to place Goodman's "New Riddle of Induction" within the context of a subjectivist understanding of inductive logic. It will be argued that predicates such as 'grue' cannot be denied projectible status in any a priori way, but must be considered in the context of a situation of inductive support. In particular, it will be argued that questions of projectibility are to be understood as a variety of questions about the ways a given sample is random. Various examples (...) are considered, including cases when 'grue' (as opposed to 'green') should be projected, and some remarks are offered on what is meant when it is claimed that a sample is random (in ways relevant to inductive support) and how such randomness is determined. The view presented helps to make clear the relation between such apparently non-projectible predicates as 'grue' and the concept of being examined. (shrink)

One of the fundamental problems in the fields of inductive logic and the philosophy of science is the one concerning inferences or projections containing so-called “grue-like” or “pathological” predicates. This problem was first put into sharp focus by Nelson Goodman, who called it the “new riddle of induction.”Goodman has shown that the few attempts by others to solve this problem are not adequate. However, very little has been written concerning Goodman's own attempt to solve the problem, namely his theory of (...) entrenchment. The purpose of this article is to show that Goodman's entrenchment theory also is inadequate as a solution to the new riddle of induction. I shall try to do this by presenting two kinds of counterexamples to the entrenchment theory: one kind illustrating a general objection to the theory as a whole ; the other kind, specific objections to particular parts of the theory. (shrink)

Although the category “race” fails as a postulated natural kind, racial, ethnic, national, linguistic, religious, and other group designations might nonetheless be considered projectible insofar as they support inductive inferences in biomedicine. This article investigates what it might mean for group concepts in population genetics and genomics to be projectible and whether the projectibility of such predicates licenses the representation of their corresponding classes as natural kinds according to currently prevailing projectibility-based accounts of natural kinds. The article draws on a (...) case study from cancer genetics, specifically, breast cancer risk in Ashkenazi Jewish women. (shrink)

This paper examines problems of order and periodicity which arise when the attempt is made to define a confirmation function for a language containing elementary number theory as applied to a universe in which the individuals are considered to be arranged in some fixed order. Certain plausible conditions of adequacy are stated for such a confirmation function. By the construction of certain types of predicates, it is proved, however, that these conditions of adequacy are violated by any confirmation function defined (...) for the type of language in question. Various possible solutions to these difficulties are explored and found to be inadequate. In particular, a proposal which stems from the suggestion to restrict a fundamental principle of confirmation to hypotheses containing only non-positional predicates is cited. This proposal, however, is shown to prevent confirmation functions from taking periodicities into account, and so is deemed unsatisfactory. A general theorem is proved to the effect that if non-positional predicates are taken to satisfy the conditions of adequacy which have been formulated, then no periodicity predicates whatsoever (i.e., predicates used in formulating hypotheses which foretell periodicities) can be subject to these conditions, on pain of contradiction. Yet it seems that periodicity predicates must be subject to these conditions of adequacy if a confirmation function is to recognize periodic occurrences. Thus, an impasse seems to be reached. In the final sections we consider the beginnings of one possible solution to these difficulties. Our proposal involves treating sets of individuals, rather than individuals themselves, as instances of an hypothesis which predicts a periodicity. On this basis we formulate new conditions of adequacy which are free from the previous difficulties and which will permit a confirmation function that satisfies them to take periodicities into account. (shrink)

First, a brief historical trace of the developments in confirmation theory leading up to Goodman's infamous "grue" paradox is presented. Then, Goodman's argument is analyzed from both Hempelian and Bayesian perspectives. A guiding analogy is drawn between certain arguments against classical deductive logic, and Goodman's "grue" argument against classical inductive logic. The upshot of this analogy is that the "New Riddle" is not as vexing as many commentators have claimed. Specifically, the analogy reveals an intimate connection between Goodman's problem, and (...) the "problem of old evidence". Several other novel aspects of Goodman's argument are also discussed. (shrink)

This paper describes the development of theories of scientific explanation since Hempel's earliest models in the 1940ies. It focuses on deductive and probabilistic whyexplanations and their main problems: lawlikeness, explanation-prediction asymmetries, causality, deductive and probabilistic relevance, maximal specifity and homogenity, the height of the probability value. For all of these topic the paper explains the most important approaches as well as their criticism, including the author's own accounts. Three main theses of this paper are: (1) Both deductive and probabilistic explanations (...) are important in science, not reducible to each other. (2) One must distinguish between (cause giving) explanations and (reason giving) justifications and predictions. (3) The adequacy of deductive as well as probabilistic explanations is relative to a pragmatically given background knowledge-which does not exclude, however, the possibility of purely semantic models. (shrink)

It is now commonly accepted that N. Goodman's predicate "grue" presents the theory of confirmation of C. G. Hempel (and other such theories) with grave difficulties. The precise nature and status of these "difficulties" has, however, never been made clear. In this paper it is argued that it is very unlikely that "grue" raises any formal difficulties for Hempel and appearances to the contrary are examined, rejected and an explanation of their intuitive appeal offered. However "grue" is shown to raise (...) an informal, "over-arching" difficulty of great magnitude for all theories of confirmation, including Hempel's theory. (shrink)

Pt. I. Zeno and the metaphysics of quantity. Zeno's paradox of measure -- Tractarian nominalism -- Logical atoms and combinatorial possibility -- Strict coherence, sigma coherence, and the metaphysics of quantity -- pt. II. Coherent degrees of belief. Higher-order degrees of belief -- A mistake in dynamic coherence arguments? -- Dynamic coherence and probability kinematics -- Updating, supposing, and MAXENT -- The structure of radical probabilism -- Diachronic coherence and radical probabilism -- pt. III. Induction. Carnapian inductive logic for Markov (...) chains -- Carnapian inductive logic and Bayesian statistics -- Bayesian projectability. (shrink)