If the total state of the universe is encodable by a real number, Hardin and Taylor have proved that there is a solution to one version of the problem of induction, or at least a solution to a closely related epistemological problem. Is this philosophical application of the Hardin-Taylor result modest enough? The paper advances grounds for doubt. [A longer and more detailed sequel to this paper, 'Proving Induction', was published in the Australasian Journal of Logic in 2011.].

Here the author of How to Solve It explains how to become a "good guesser." Marked by G. Polya's simple, energetic prose and use of clever examples from a wide range of human activities, this two-volume work explores techniques of guessing, inductive reasoning, and reasoning by analogy, and the role they play in the most rigorous of deductive disciplines.

Mathematical instrumentalism construes some parts of mathematics, typically the abstract ones, as an instrument for establishing statements in other parts of mathematics, typically the elementary ones. Gödel’s second incompleteness theorem seems to show that one cannot prove the consistency of all of mathematics from within elementary mathematics. It is therefore generally thought to defeat instrumentalisms that insist on a proof of the consistency of abstract mathematics from within the elementary portion. This article argues that though (...) some versions of mathematical instrumentalism are defeated by Gödel’s theorem, not all are. By considering inductive reasons in mathematics, we show that some mathematical instrumentalisms survive the theorem. (shrink)

In this paper, I argue that there are cases of explanatory induction in mathematics. To do so, I first introduce the notion of explanatory definition in the context of mathematical explanation. A large part of the paper is dedicated to introducing and analyzing this notion of explanatory definition and the role it plays in mathematics. After doing so, I discuss a particular inductive definition in advanced mathematics—CW\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${ CW}$$\end{document}-complexes—and (...) argue that it is explanatory. With this, we see that there are cases of explanatory induction. (shrink)

Mathematics used to be portrayed as a deductive science. Stemming from Polya, however, is a philosophical movement which broadens the concept of mathematical reasoning to include inductive or quasi-empirical methods. Interest in inductive methods is a welcome turn from foundationalism toward a philosophy grounded in mathematical practice. Regrettably, though, the conception of mathematical reasoning embraced by quasi-empiricists is still too narrow to include the sort of thought-experiment which Mueller describes as traditional mathematical proof and which Lakatos examines in Proofs (...) and refutations. This paper extends the concept of mathematical reasoning along two further dimensions to accommodate thought-experiment.Keywords: Thought-experiment; Informal proof; Mathematical reasoning. (shrink)

The context for this paper is Feferman's theory of explicit mathematics, T 0 . We address a problem that was posed in [6]. Let MID be the principle stating that any monotone operation on classifications has a least fixed point. The main objective of this paper is to show that T 0 + MID, when based on classical logic, also proves the existence of non-monotone inductive definitions that arise from arbitrary extensional operations on classifications. From the latter we deduce (...) that MID, when adjoined to classical T 0 , leads to a much stronger theory than T 0. (shrink)

The method of mathematical induction: The method of mathematical induction -- Examples and exercises -- The proof of induction of some theorems of elemetary algebra -- Solutions.

In this paper1, we explore some positive elements from the Epicurean position on mathematics. Is induction important in mathematical practice or useful in proof? Does atomism appear in mathematics and in what ways? Keywords: Epicurus, induction, Polya, proof, atomism.

Handbook of Mathematical Induction: Theory and Applications shows how to find and write proofs via mathematical induction. This comprehensive book covers the theory, the structure of the written proof, all standard exercises, and hundreds of application examples from nearly every area of mathematics. In the first part of the book, the author discusses different inductive techniques, including well-ordered sets, basic mathematical induction, strong induction, double induction, infinite descent, downward induction, and several variants. He (...) then introduces ordinals and cardinals, transfinite induction, the axiom of choice, Zorn’s lemma, empirical induction, and fallacies and induction. He also explains how to write inductive proofs. The next part contains more than 750 exercises that highlight the levels of difficulty of an inductive proof, the variety of inductive techniques available, and the scope of results provable by mathematical induction. Each self-contained chapter in this section includes the necessary definitions, theory, and notation and covers a range of theorems and problems, from fundamental to very specialized. The final part presents either solutions or hints to the exercises. Slightly longer than what is found in most texts, these solutions provide complete details for every step of the problem-solving process. (shrink)

This study investigated the cognitive processes involved in inductive reasoning. Sixteen undergraduates solved quadratic function–finding problems and provided concurrent verbal protocols. Three fundamental areas of inductive activity were identified: Data Gathering, Pattern Finding, and Hypothesis Generation. These activities are evident in three different strategies that they used to successfully find functions. In all three strategies, Pattern Finding played a critical role not previously identified in the literature. In the most common strategy, called the Pursuit strategy, participants created new quantities from (...) x and y, detected patterns in these quantities, and expressed these patterns in terms of x. These expressions were then built into full hypotheses. The processes involved in this strategy are instantiated in an ACT‐based model that simulates both successful and unsuccessful performance. The protocols and the model suggest that numerical knowledge is essential to the detection of patterns and, therefore, to higher‐order problem solving. (shrink)

I support Rips et al.'s critique of psychology through (1) a complementary argument about the normative, modal, constitutive nature of mathematical principles. I add two reservations about their analysis of mathematical induction, arguing (2) for constructivism against their logicism as to its interpretation and formation in childhood (Smith 2002), and (3) for Piaget's account of reasons in rule learning.

Philosophers who regard some mathematical proofs as explaining why theorems hold, and others as merely proving that they do hold, disagree sharply about the explanatory value of proofs by mathematical induction. I offer an argument that aims to resolve this conflict of intuitions without making any controversial presuppositions about what mathematical explanations would be.

The central argument that Leslie Smith makes in this study is that reasoning by mathematical induction develops during childhood. The basis for this claim is a study conducted with children aged five to seven years in school years one and two.

Poincaré and Prawitz have both developed an account of how one can acquire knowledge through reasoning by mathematical induction. Surprisingly, their two accounts are very close to each other: both consider that what underlies reasoning by mathematical induction is a certain chain of inferences by modus ponens ‘moving along’, so to speak, the well-ordered structure of the natural numbers. Yet, Poincaré’s central point is that such a chain of inferences is not sufficient to account for the knowledge acquisition (...) of the universal propositions that constitute the conclusions of inferences by mathematical induction, as this process would require to draw an infinite number of inferences. In this paper, we propose to examine Poincaré’s point—that we will call the closure issue—in the context of Prawitz’s framework where inferences are represented as operations on grounds. We shall see that the closure issue is a challenge that also faces Prawitz’s own account of mathematical induction and which points out to an epistemic gap that the chain of modus ponens cannot bridge. One way to address the challenge is to introduce suitable additional inferential operations that would allow to fill the gap. We will end the paper by sketching such a possible solution. (shrink)

If α and β are ordinals, α ≤ β, and $\beta \nleq \alpha$ , then α + 1 ≤ β. The first result of this paper shows that the restriction of this statement to countable well orderings is provably equivalent to ACA 0 , a subsystem of second order arithmetic introduced by Friedman. The proof of the equivalence is reminiscent of Dekker's construction of a hypersimple set. An application of the theorem yields the equivalence of the set comprehension scheme ACA (...) 0 and an arithmetical transfinite induction scheme. (shrink)

In this paper I want to discuss some basic problems of inductive logic, i.e. of the attempt to solve the problem of induction by means of a calculus of logical probability. I shall try to throw some light upon these problems by contrasting inductive logic, based on logical probability, and working with undefined samples of observations, with mathematical statistics, based on statistical probability, and working with representative random samples.

This book seeks to offer original answers to all the major open questions in epistemology—as indicated by the book’s title. These questions and answers arise organically in the course of a validation of the entire corpus of human knowledge. The book explains how we know what we know, and how well we know it. The author presents a positive theory, motivated and directed at every step not by a need to reply to skeptics or subjectivists, but by the need of (...) a rational individual to know the world. -/- The author draws heavily from Ayn Rand’s theory of concepts as presented in her book, Introduction to Objectivist Epistemology, but departs from her epistemology—especially as explicated by leading exponents of her philosophy—in important ways. Areas of departure include the perception of entities and the role of probability theory in epistemology. -/- A main idea in the book is to begin the validation of the law of causality by identifying that existence causes our consciousness of it. Another key idea is this: The very fact that we perceive entities is the most basic and most extensive evidence that causal forces and causal interactions are regular. -/- Applying Ayn Rand’s principle that characteristics are ranges of measurement, the book offers a philosophical validation of “nonparametric predictive inference,” in turn providing an objective basis for prior probabilities in Bayesian analysis. -/- This book is primarily for a specialized readership—familiar with epistemological ideas and with Ayn Rand’s theory of concepts in particular. The last third of the book uses probability theory and mathematics somewhat beyond basic calculus, but less mathematical explanations are also included to make the general ideas accessible to lay readers. (shrink)

Hailed by the Bulletin of the American Mathematical Society as "easy to use and a pleasure to read," this research monograph is recommended for students and professionals interested in model theory and definability theory. The sole prerequisite is a familiarity with the basics of logic, model theory, and set theory. 1974 edition.

The account of meta-induction (G. Schurz, Hume’s problem solved: the optimality of meta-induction, MIT Press, Cambridge, 2019) proposes a two-step solution to the problem of induction. Step 1 consists in a mathematical a priori justification of the predictive optimality of meta-induction, upon which step 2 builds a meta-inductive a posteriori justification of object-induction based on its superior track record (Sect. 1). Sterkenburg (Br J Philos Sci, forthcoming. 10.1086/717068/) challenged this account by arguing that meta-induction (...) can only provide a (non-circular) justification of inductive predictions for now and for the next future, but not a justification of inductive generalizations (Sect. 2). This paper develops a meta-inductive method that does provide an a posteriori justification of inductive generalizations, in the form of exchangeability conditions (Sect. 3). In Sect. 4, a limitation of the proposed method is worked out: while the method can justify weakly lawlike generalizations, the justification of strongly lawlike generalizations (claimed to hold for all eternity) requires epistemic principles going beyond meta-induction based on predictive success. (shrink)

We characterize the proof-theoretic strength of systems of explicit mathematics with a general principle asserting the existence of least fixed points for monotone inductive definitions, in terms of certain systems of analysis and set theory. In the case of analysis, these are systems which contain the Σ12-axiom of choice and Π12-comprehension for formulas without set parameters. In the case of set theory, these are systems containing the Kripke-Platek axioms for a recursively inaccessible universe together with the existence of a (...) stable ordinal. In all cases, the exact strength depends on what forms of induction are admitted in the respective systems. (shrink)

Goncharov and Peretyat'kin independently gave necessary and sufficient conditions for when a set of types of a complete theory is the type spectrum of some homogeneous model of. Their result can be stated as a principle of second order arithmetic, which is called the Homogeneous Model Theorem (HMT), and analyzed from the points of view of computability theory and reverse mathematics. Previous computability theoretic results by Lange suggested a close connection between HMT and the Atomic Model Theorem (AMT), which (...) states that every complete atomic theory has an atomic model. The authors show that HMT and AMT are indeed equivalent in the sense of reverse mathematics, as well as in a strong computability theoretic sense and do the same for an analogous result of Peretyat'kin giving necessary and sufficient conditions for when a set of types is the type spectrum of some model. (shrink)

In a famous passage from his al-Bāhir, al-Samaw’al proves the identity which we would now write as (ab)n=anbn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(ab)^n=a^n b^n$$\end{document} for the cases n=3,4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n=3,4$$\end{document}. He also calculates the equivalent of the expansion of the binomial (a+b)n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(a+b)^n$$\end{document} for the same values of n and describes the construction of what we now call the Pascal Triangle, showing (...) the table up to its 12th row. We give a literal translation of the whole passage, along with paraphrases in more modern or symbolic form. We discuss the influence of the Euclidean tradition on al-Samaw’al’s presentation, and the role that diagrams might have played in helping al-Samaw’al’s readers follow his arguments, including his supposed use of an early form of mathematical induction. (shrink)

Pure Inductive Logic is the study of rational probability treated as a branch of mathematical logic. This monograph, the first devoted to this approach, brings together the key results from the past seventy years, plus the main contributions of the authors and their collaborators over the last decade, to present a comprehensive account of the discipline within a single unified context.

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)

The purpose of this paper may be found in the following quotation. “Whenever an argument can be made to lead to a descending infinitude of natural numbers the hypothesis upon which the argument rests becomes untenable. This method of proof is called the method of infinite descent;.... It would be interesting and valuable to compare this method with the method of mathematical induction.”.

Mathematical logic is a branch of mathematics that takes axiom systems and mathematical proofs as its objects of study. This book shows how it can also provide a foundation for the development of information science and technology. The first five chapters systematically present the core topics of classical mathematical logic, including the syntax and models of first-order languages, formal inference systems, computability and representability, and Gödel’s theorems. The last five chapters present extensions and developments of classical mathematical logic, particularly (...) the concepts of version sequences of formal theories and their limits, the system of revision calculus, proschemes (formal descriptions of proof methods and strategies) and their properties, and the theory of inductive inference. All of these themes contribute to a formal theory of axiomatization and its application to the process of developing information technology and scientific theories. The book also describes the paradigm of three kinds of language environments for theories and it presents the basic properties required of a meta-language environment. Finally, the book brings these themes together by describing a workflow for scientific research in the information era in which formal methods, interactive software and human invention are all used to their advantage. The second edition of the book includes major revisions on the proof of the completeness theorem of the Gentzen system and new contents on the logic of scientific discovery, R-calculus without cut, and the operational semantics of program debugging. This book represents a valuable reference for graduate and undergraduate students and researchers in mathematics, information science and technology, and other relevant areas of natural sciences. Its first five chapters serve as an undergraduate text in mathematical logic and the last five chapters are addressed to graduate students in relevant disciplines. (shrink)

Is it possible to combine different logics into a coherent system with the goal of applying it to specific problems so that it sheds some light on foundational aspects of those logics? These are two of the most basic issues of combining logics. Paranormal modal logic is a combination of paraconsistent logic and modal logic. In this paper, I propose two further combinatory developments, focusing on each one of these two issues. On the foundational side, I combine paranormal modal logic (...) with normal modal logic, resulting into a paraconsistent and paracomplete multimodal logic dealing with the notions of plausibility and certainty. On the application side, I combine this logic with Reiter’s default logic, resulting into an inductive and consequently nonmonotonic paraconsistent and paracomplete logic able to represent some key inductive principles. (shrink)