The previous two parts of the paper demonstrate that the interpretation of Fermat’s last theorem (FLT) in Hilbert arithmetic meant both in a narrow sense and in a wide sense can suggest a proof by induction in Part I and by means of the Kochen - Specker theorem in Part II. The same interpretation can serve also for a proof FLT based on Gleason’s theorem and partly similar to that in Part II. The concept of (probabilistic) measure of a subspace (...) of Hilbert space and especially its uniqueness can be unambiguously linked to that of partial algebra or incommensurability, or interpreted as a relation of the two dual branches of Hilbert arithmetic in a wide sense. The investigation of the last relation allows for FLT and Gleason’s theorem to be equated in a sense, as two dual counterparts, and the former to be inferred from the latter, as well as vice versa under an additional condition relevant to the Gödel incompleteness of arithmetic to set theory. The qubit Hilbert space itself in turn can be interpreted by the unity of FLT and Gleason’s theorem. The proof of such a fundamental result in number theory as FLT by means of Hilbert arithmetic in a wide sense can be generalized to an idea about “quantum number theory”. It is able to research mathematically the origin of Peano arithmetic from Hilbert arithmetic by mediation of the “nonstandard bijection” and its two dual branches inherently linking it to information theory. Then, infinitesimal analysis and its revolutionary application to physics can be also re-realized in that wider context, for example, as an exploration of the way for physical quantity of time (respectively, for time derivative in any temporal process considered in physics) to appear at all. Finally, the result admits a philosophical reflection of how any hierarchy arises or changes itself only thanks to its dual and idempotent counterpart. (shrink)

Le problème de l’induction (humien) a récemment été abordé par Steel dans son article de 2010. Celui-ci soutient que les théories d’apprentissage formelles permettent de justifier logiquement le principe de l’induction, ce dernier assurant la fiabilité logique des méthodes. Cette proposition a été critiquée par Howson en 2011, ce dernier mettant en doute la possibilité même qu’une méthode puisse être logiquement fiable. Bien que Steel ait offert une réponse à cette critique, il n’y répond pas directement. Dans le présent article, (...) une réponse frontale à celle-ci est offerte en s’inspirant des pratiques de tests d’hypothèses en sciences biologiques. Pour ce faire, une règle de construction des ensembles d’hypothèses est proposée, règle offrant une justification logique au fait qu’une méthode convergera nécessairement vers la vérité. Cet amendement étant cohérent avec l’ensemble de la proposition de Steel, il est ainsi possible d’affirmer que sa thèse est renforcée par cette proposition. (shrink)

David Armstrong argues that necessitation relations among universals are the best explanation of some of our observations. If we consequently accept them into our ontologies, then we can justify induction, because these necessitation relations also have implications for the unobserved. By embracing Armstrongian universals, we can vindicate some of our strongest epistemological intuitions and answer the Problem of Induction. However, Armstrong’s reasoning has recently been challenged on a variety of grounds. Critics argue against both Armstrong’s usage of inference to the (...) best explanation and even whether, by Armstrong’s own standards, necessitation relations offer a potential explanation of this explanandum, let alone the best explanation. I defend Armstrong against these particular criticisms. Firstly, even though there are reasons to think that Armstrong’s justification fails as a self-contained defence of induction, it can usefully complement several other answers to Hume. Secondly, I argue that Armstrong’s reasoning is consistent with his own standards for explanation. (shrink)

A common criticism of Hume’s famous anti-induction argument is that it is vitiated because it fails to foreclose the possibility of an authentically probabilistic justification of induction. I argue that this claim is false, and that on the contrary, the probability calculus itself, in the form of an elementary consequence that I call Hume’s Theorem, fully endorses Hume’s argument. Various objections, including the often-made claim that Hume is defeated by de Finetti’s exchangeability results, are considered and rejected.

According to John D. Norton's Material Theory of Induction, all reasonable inductive inferences are justified in virtue of background knowledge about local uniformities in nature. These local uniformities indicate that our samples are likely to be representative of our target population in our inductions. However, a variety of critics have noted that there are many circumstances in which induction seems to be reasonable, yet such background knowledge is apparently absent. I call such absences ‘the frontiers of science', where background scientific (...) theories do not provide information about such local uniformities. I argue that the Material Theory of Induction can be reconciled with our intuitions in favour of these inductions. I adapt an attempted justification of induction in general, the Combinatoric Justification of Induction, into a more modest rationalisation at the less foundational level that the critics discuss. Subject to a number of conditions, we can extrapolate from large samples using our knowledge of facts about the minimum proportions of representative subsets of finite sets. I also discuss some of Norton's own criticisms of his theory and argue that he is overly pessimistic. I conclude that Norton's theory at least performs well at the frontiers of science. (shrink)

In a recent article in this journal, Daniel Steel charges me with committing a fallacy in my discussion of inductive rules. I show that the charge is false, and that Steel's own attempt to validate enumerative induction in terms of formal learning theory is itself fallacious. I go on to argue that, contra Steel, formal learning theory is in principle incapable of answering Hume's famous claim that any attempt to justify induction will beg the question.

Howson's critique of my essay on Hume's problem of induction levels two main charges. First, Howson claims that I have attributed to him an error that he never made, and in fact which he warned against in the very text that I cite. Secondly, Howson argues that my proposed solution to Hume's problem is flawed on technical and philosophical grounds. In response to the first charge, I explain how Howson's text justifies attributing to him the claim that the principle of (...) induction is shown to be inconsistent by Goodman's riddle. In regards to the second, I show that Howson's objections rest on misunderstandings of formal learning theory and on conflating the problem of induction with the problem of unconceived alternatives. (shrink)

Inductive reasoning aims at constructing rules and models of general applicability from a restricted set of observations. Induction is a keystone in natural sciences, and it influences diverse application fields such as engineering, medicine and economics. More generally, induction plays a major role in the way humans learn and operate in their everyday life. The level of reliability that a model achieves depends on how informative the observations are relative to the flexibility of the process by which the model is (...) constructed. When the process is articulated so that the model can incorporate descriptive details and subtleties, a large set of informative observations are required to reliably tune the model, whereas models obtained from simple procedures can be tuned with fewer observations. This article introduces the concept of “dominance”, which refers to the situation in which a reduced subset of observations suffices to reconstruct the model. A mathematical framework is presented to quantify the reliability of learning procedures as a function of the size of the subset of dominant observations. Although limited in scope, we believe that our study can contribute to the understanding of some fundamental mechanisms by which knowledge is generated from observations in inductive reasoning. (shrink)

In the first section, five major attempts to solve the problem of induction and their failures are discussed. In the second section, an account of meta-induction is introduced. It offers a novel solution to the problem of induction, based on mathematical theorems about the predictive optimality of attractivity-weighted meta-induction. In the third section, how the a priori justification of meta-induction provides a non-circular a posteriori justification of object-induction, based on its superior track record, is explained. In the fourth section, four (...) important extensions and refinements of the method of meta-induction are presented. The final section, summarizes the major impacts of the program of meta-induction for epistemology, the philosophy of science and cognitive science. (shrink)