Brouwer’s view on induction has relatively recently been characterised as one on which it is not only intuitive (as expected) but functional, by van Dalen. He claims that Brouwer’s ‘Ur-intuition’ also yields the recursor. Appealing to Husserl’s phenomenology, I offer an analysis of Brouwer’s view that supports this characterisation and claim, even if assigning the primary role to the iterator instead. Contrasts are drawn to accounts of induction by Poincaré, Heyting, and Kreisel. On the phenomenological side, the analysis (...) provides an alternative to that in Tieszen’s Mathematical Intuition, and confirms a view of Gödel on his Dialectica Interpretation. (shrink)

This comprehensive discussion of the problem of rational belief develops the subject on the pattern of Bayesian decision theory. The analogy with decision theory introduces philosophical issues not usually encountered in logical studies and suggests some promising new approaches to old problems."We owe Professor Levi a debt of gratitude for producing a book of such excellence. His own approach to inductive inference is not only original and profound, it also clarifies and transforms the work of his predecessors. In short, the (...) book deserves to become a classic....There is a great deal of interest in the book besides these basic matters [forumlating rules of acceptance]. Some of the most interesting chapters are those that examine the implications of such rules. The discussions of probability, generalization, and various forms of inference are brilliant and enlightening. Indeed, the problems and methods elaborated by Professor Levi in his book serve as a new foundation for the study of inductive inference."--Keith Lehrer, Nous"Levi's book is an extremely interesting report on 'tentative and speculative first steps' toward a decision-theoretic approach to inductive inference....Professor Levi is to be congratulated on his ingenious development and application of this approach...."--Richard C. Jeffrey, The Journal of Philosophy. (shrink)

A revisionist account of how philosophical induction was conceived in the ancient world and how that conception was transmitted, altered, and then rediscovered. I show how philosophers of late antiquity and then the medieval period came step-by-step to seriously misunderstand Aristotle’s view of induction and how that mistake was reversed by humanists in the Renaissance and then especially by Francis Bacon. I show, naturally enough then, that in early modern science, Baconians were Aristotelians and Aristotelians were Baconians.

In _Reliable Reasoning_, Gilbert Harman and Sanjeev Kulkarni -- a philosopher and an engineer -- argue that philosophy and cognitive science can benefit from statistical learning theory, the theory that lies behind recent advances in machine learning. The philosophical problem of induction, for example, is in part about the reliability of inductive reasoning, where the reliability of a method is measured by its statistically expected percentage of errors -- a central topic in SLT. After discussing philosophical attempts to evade (...) the problem of induction, Harman and Kulkarni provide an admirably clear account of the basic framework of SLT and its implications for inductive reasoning. They explain the Vapnik-Chervonenkis dimension of a set of hypotheses and distinguish two kinds of inductive reasoning. The authors discuss various topics in machine learning, including nearest-neighbor methods, neural networks, and support vector machines. Finally, they describe transductive reasoning and suggest possible new models of human reasoning suggested by developments in SLT. (shrink)

This chapter focuses on developing an experimental technique for inducing flow and creating instances of effortless action in the laboratory. The effort to experimentally induce flow involves two conditions which are correlated with the flow state: The firstis the idea that the challenges of a given task are well within one’s capabilities; the other involves perceived goals and immediate feedback from the given task. The chapter explores these factors along with other contextual factors, including autonomy and distractions, to experimentally induce (...) flow and demonstrate instances of effortless action in the laboratory. One of the most extensively used approaches for experimental induction of flow in the laboratory involves exploring difficulty levels of video games. (shrink)

Historical records show that there was no real concept of probability in Europe before the mid-seventeenth century, although the use of dice and other randomizing objects was commonplace. Ian Hacking presents a philosophical critique of early ideas about probability, induction, and statistical inference and the growth of this new family of ideas in the fifteenth, sixteenth, and seventeenth centuries. Hacking invokes a wide intellectual framework involving the growth of science, economics, and the theology of the period. He argues that (...) the transformations that made it possible for probability concepts to emerge have constrained all subsequent development of probability theory and determine the space within which philosophical debate on the subject is still conducted. First published in 1975, this edition includes an introduction that contextualizes his book in light of developing philosophical trends. Ian Hacking is the winner of the Holberg International Memorial Prize 2009. (shrink)

I wish more books of philosophy were like this one. It is elegantly written. It is filled with provocative claims and ingenious arguments. It is a really good read, even while it forces us to rethink many of our assumptions about practical reason and practical reasoning, morality and agency.

A new approach to Hume's problem of induction that justifies the optimality of induction at the level of meta-induction. Hume's problem of justifying induction has been among epistemology's greatest challenges for centuries. In this book, Gerhard Schurz proposes a new approach to Hume's problem. Acknowledging the force of Hume's arguments against the possibility of a noncircular justification of the reliability of induction, Schurz demonstrates instead the possibility of a noncircular justification of the optimality of (...) class='Hi'>induction, or, more precisely, of meta-induction (the application of induction to competing prediction models). Drawing on discoveries in computational learning theory, Schurz demonstrates that a regret-based learning strategy, attractivity-weighted meta-induction, is predictively optimal in all possible worlds among all prediction methods accessible to the epistemic agent. Moreover, the a priori justification of meta-induction generates a noncircular a posteriori justification of object induction. Taken together, these two results provide a noncircular solution to Hume's problem. Schurz discusses the philosophical debate on the problem of induction, addressing all major attempts at a solution to Hume's problem and describing their shortcomings; presents a series of theorems, accompanied by a description of computer simulations illustrating the content of these theorems (with proofs presented in a mathematical appendix); and defends, refines, and applies core insights regarding the optimality of meta-induction, explaining applications in neighboring disciplines including forecasting sciences, cognitive science, social epistemology, and generalized evolution theory. Finally, Schurz generalizes the method of optimality-based justification to a new strategy of justification in epistemology, arguing that optimality justifications can avoid the problems of justificatory circularity and regress. (shrink)

Putnam and Laudan separately argue that the falsity of past scientific theories gives us reason to doubt the truth of current theories. Their arguments have been highly influential, and have generated a significant literature over the past couple of decades. Most of this literature attempts to defend scientific realism by attacking the historical evidence on which the premises of the relevant argument are based. However, I argue that both Putnam's and Laudan's arguments are fallacious, and hence attacking their premises is (...) unnecessary. The paper concludes with a discussion of the further historical evidence that would be required if the pessimistic induction is to present a serious threat to scientific realism. (shrink)

1. I shall attempt in this paper to give a rounded, if schematic, account of the concept of probability. My central concern will be to clarify the sense in which law-like statements (including 'statistical' law-like statements) are made probable by observational data which, in a sense equally demanding analysis, 'accord' with them.

This article poses a challenge to Schurz’s proposed metainductive justification of induction. It is argued that Schurz’s argument requires a notion of optimality that can deal with an expanding pool of prediction strategies.

One type of soft-line reply to manipulation arguments, which I call ‘the another-agent reply’, focuses on the existence of some controlling agent and how this can undermine the actor's moral responsibility. A well-known challenge to this type of reply is the so-called ‘machine induction’ case. This paper provides an argument for why ‘machine induction’ presents no real challenge to the another-agent reply. It further argues that any soft-liner who does not leave room for the existence of some controlling (...) agent in their explanation of why manipulation undermines responsibility will face a dilemma. Thus, instead of presenting a challenge to the another-agent reply, ‘machine induction’ actually presents a reason in support of it. (shrink)

A common style of argument in the literature on free will and moral responsibility is the Manipulation Argument. These tend to begin with a case of an agent in a deterministic universe who is manipulated, say, via brain surgery, into performing some action. Intuitively, this agent is not responsible for that action. Yet, since there is no relevant difference, with respect to whether an agent is responsible, between the manipulated agent and a typical agent in a deterministic universe, responsibility is (...) not compatible with the truth of determinism. In response, some theorists have argued that there is a relevant difference, and have developed two sorts of accounts of that difference: bypassing views, and manipulator-focused views. Manipulator-focused views suggest that the difference concerns the presence of a manipulator, whereas bypassing views suggest that the relevant difference concerns the fact that the action issues from attitudes that the manipulated agent acquired in a way that bypassed her capacities for control over her mental life. One sort of case used to decide between these sorts of accounts is a case of machine induction, which is just like a manipulation case, yet the change in the agent is the result of some natural force. Against the received view, Xiaofei Liu argues that such cases pose problems for bypassing views, and favor manipulator-focused views instead. This paper addresses Liu’s arguments, as well as a variety of cases, concluding that cases of machine induction do not provide motivation for a bypassing theorist to adopt a manipulator-focused view. (shrink)

By a well-known result of Kotlarski et al., first-order Peano arithmetic \ can be conservatively extended to the theory \ of a truth predicate satisfying compositional axioms, i.e., axioms stating that the truth predicate is correct on atomic formulae and commutes with all the propositional connectives and quantifiers. This result motivates the general question of determining natural axioms concerning the truth predicate that can be added to \ while maintaining conservativity over \. Our main result shows that conservativity fails even (...) for the extension of \ obtained by the seemingly weak axiom of disjunctive correctness \ that asserts that the truth predicate commutes with disjunctions of arbitrary finite size. In particular, \ implies \\). Our main result states that the theory \ coincides with the theory \ obtained by adding \-induction in the language with the truth predicate. This result strengthens earlier work by Kotlarski and Cieśliński. For our proof we develop a new general form of Visser’s theorem on non-existence of infinite descending chains of truth definitions and prove it by reduction to Gödel’s second incompleteness theorem, rather than by using the Visser–Yablo paradox, as in Visser’s original proof. (shrink)

The important recent book by Schurz ( 2019 ) appreciates that the no-free-lunch theorems (NFL) have major implications for the problem of (meta) induction. Here I review the NFL theorems, emphasizing that they do not only concern the case where there is a uniform prior—they prove that there are “as many priors” (loosely speaking) for which any induction algorithm _A_ out-generalizes some induction algorithm _B_ as vice-versa. Importantly though, in addition to the NFL theorems, there are many (...) _free lunch_ theorems. In particular, the NFL theorems can only be used to compare the expected performance of an induction algorithm _A_, considered in isolation, with the expected performance of an induction algorithm _B_, considered in isolation. There is a rich set of free lunches which instead concern the statistical _correlations_ among the generalization errors of induction algorithms. As I describe, the meta-induction algorithms that Schurz advocates as a “solution to Hume’s problem” are simply examples of such a free lunch based on correlations among the generalization errors of induction algorithms. I end by pointing out that the prior that Schurz advocates, which is uniform over bit frequencies rather than bit patterns, is contradicted by thousands of experiments in statistical physics and by the great success of the maximum entropy procedure in inductive inference. (shrink)

We present an explanatory objection to Norton's material theory of induction, as applied to predictive inferences. According to the objection we present, there is an explanatory disconnect between our beliefs about the future and the relevant future facts. We argue that if we recognize such a disconnect, we are no longer rationally entitled to our future beliefs.

I propose to elaborate some hints dropped by Mr. Strawson 2 in order to relieve those pressures of language that have led philosophers to pose and attempt to answer the pseudo-question, “How is induction justified?” Once the source of these pressures is exposed we can turn our attention to the real problems of induction, namely how particular inductive procedures are justified, without feeling that a deeper problem remains always to be solved.

Over the last few decades Michael Dummett developed a rich program for assessing logic and the meaning of the terms of a language. He is also a major exponent of Frege's version of logicism in the philosophy of mathematics. Over the last decade, Neil Tennant developed an extensive version of logicism in Dummettian terms, and Dummett influenced other contemporary logicists such as Crispin Wright and Bob Hale. The purpose of this paper is to explore the prospects for Fregean logicism within (...) a broadly Dummettian framework. The conclusions are mostly negative: Dummett's views on analyticity and the logical/non-logical boundary leave little room for logicism. Dummett's considerations concerning manifestation and separability lead to a conservative extension requirement: if a sentence S is logically true, then there is a proof of S which uses only the introduction and elimination rules of the logical terms that occur in S. If basic arithmetic propositions are logically true-as the logicist contends-then there is tension between this conservation requirement and the ontological commitments of arithmetic. It follows from Dummett's manifestation requirements that if a sentence S is composed entirely of logical terminology, then there is a formal deductive system D such that S is analytic, or logically true, if and only if S is a theorem of D. There is a deep conflict between this result and the essential incompleteness, or as Dummett puts it, the indefinite extensibility, of arithmetic truth. (shrink)

The philosophical background important to Mill’s theory of induction has two major components: Richard Whately’s introduction of the uniformity principle into inductive inference and the loss of the idea of formal cause.

LAS is a program that acquires augmented transition network (ATN) grammars. It requires as data sentences of the language and semantic network representatives of their meaning. In acquiring the ATN grammars, it induces the word classes of the language, the rules of formation for sentences, and the rules mapping sentences onto meaning. The induced ATN grammar can be used both for sentence generation and sentence comprehension. Critical to the performance of the program are assumptions that it makes about the relation (...) between sentence structure and surface structure (the graph deformation condition), about when word classes may be formed and when ATN networks may be merged, and about the structure of noun phrases. These assumptions seem to be good heuristics which are largely true for natural languages although they would not be true for many nonnatural languages. Provided these assumptions are satisfied LAS seems capable of learning any context‐free language. (shrink)

The necessitarian solution to the problem of induction involves two claims: first, that necessary connections are justified by an inference to the best explanation; second, that the best theory of necessary connections entails the timeless uniformity of nature. In this paper, I defend the second claim. My arguments are based on considerations from the metaphysics of laws, properties, and fundamentality.

According to the conflict monitoring hypothesis, conflict monitoring and inhibitory control in cognitive control mainly cause activity in the anterior cingulate cortex and control-related prefrontal cortex in many cognitive tasks. However, the role of brain regions in the default mode network in cognitive control during category induction tasks is unclear. To test the role of the ACC, PFC, and subregions of the DMN elicited by cognitive control during category induction, a modified category induction task was performed using (...) simultaneous fMRI scanning. The results showed that the left middle frontal gyrus and bilateral dorsal ACC/medial frontal gyrus were sensitive to whether conflict information appears, but not to the level of conflict. In addition, the bilateral ventral ACC, especially the right vACC, a part of the DMN, showed significant deactivation with an increase in cognitive effort depending on working memory. These findings not only offer further evidence for the important role of the dorsolateral PFC and dorsal ACC in cognitive control during categorization but also support the functional distinction of the dorsal/ventral ACC in the category induction task. (shrink)

We propose a new hybrid data mining method for predicting protein-protein interactions combining Likelihood-Ratio with rule induction algorithms. In essence, the new method consists of using a rule induction algorithm to discover rules representing partitions of the data, and then the discovered rules are interpreted as “bins” which are used to compute likelihood ratios. This new method is applied to the prediction of protein-protein interactions in the Saccharomyces Cerevisiae genome, using predictive genomic features in an integrated scheme. The (...) results show that the new hybrid method outperforms a pure likelihood ratio based approach. (shrink)

I explain the New Riddle of Induction (Goodman 1946, 1955) in very brief words.

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 was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work. 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 (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant. (shrink)