Mathematical Finitism

Quantum computer is considered as a generalization of Turing machine. The bits are substituted by qubits. In turn, a "qubit" is the generalization of "bit" referring to infinite sets or series. It extends the consept of calculation from finite processes and algorithms to infinite ones, impossible as to any Turing machines (such as our computers). However, the concept of quantum computer mets all paradoxes of infinity such as Gödel's incompletness theorems (1931), etc. A philosophical reflection on how quantum computer might (...) implement the idea of "infinite calculation" is the main subject. (shrink)

This article is about the ontological dispute between finitists, who claim that only finitely many numbers exist, and infinitists, who claim that infinitely many numbers exist. Van Bendegem set out to solve the 'general problem' for finitism: how can one recast finite fragments of classical mathematics in finitist terms? To solve this problem Van Bendegem comes up with a new brand of finitism, namely so-called 'apophatic finitism'. In this article it will be argued that apophatic finitism is unable to represent (...) the negative ontological commitments of infinitism or, in other words, that which does not exist according to infinitism. However, there is a brand of infinitism, so-called 'apophatic infinitism', that is able to represent both the positive and the negative ontological commitments of apophatic finitism. Unfortunately, apophatic finitism cannot adopt that way without losing the ability to represent the positive ontological commitments of infinitism. (shrink)

On pense généralement que l'impossibilité, l'incomplétdulité, la paracohérence, l'indécidabilité, le hasard, la calcul, le paradoxe, l'incertitude et les limites de la raison sont des questions scientifiques physiques ou mathématiques disparates ayant peu ou rien dans terrain d'entente. Je suggère qu'ils sont en grande partie des problèmes philosophiques standard (c.-à-d., jeux de langue) qui ont été la plupart du temps résolus par Wittgenstein plus de 80 ans. Je fournis un bref résumé de quelques-unes des principales conclusions de deux des plus éminents (...) étudiants du comportement des temps modernes, Ludwig Wittgenstein et John Searle, sur la structure logique de l'intentionnalité (esprit, langue, comportement), en prenant comme point de départ La découverte fondamentale de Wittgenstein, à savoir que tous les problèmes véritablement « philosophiques » sont les mêmes, les confusions sur la façon d'utiliser la langue dans un contexte particulier, et donc toutes les solutions sont les mêmes— en regardant comment la langue peut être utilisée dans le contexte en cause afin que sa vérité (Conditions de satisfaction ou COS) sont claires. Le problème fondamental est que l'on peut dire n'importe quoi, mais on ne peut pas signifier (état clair COS pour) toute déclaration arbitraire et le sens n'est possible que dans un contexte très spécifique. Je dissé que quelques écrits de quelques-uns des principaux commentateurs sur ces questions d'un point de vue wittgensteinien dans le cadre de la perspective moderne des deux systèmes de pensée (popularisé comme «penser vite, penser lentement»), en utilisant une nouvelle table de intentionnalité et la nomenclature de nouveaux systèmes doubles. Je montre qu'il s'agit d'un puissant heuristique pour décrire la vraie nature de ces questions scientifiques, physiques ou mathématiques putatives qui sont vraiment mieux abordés comme des problèmes philosophiques standard de la façon dont la langue doit être utilisée (jeux de langue dans Wittgenstein terminologie). (shrink)

More than half of Wittgenstein’s writings from the years between his return to philosophy in 1929 and the completion of Part I of the Philosophical Investigations in 1945 are about issues in the philosophy of mathematics. In 1929 he wrote that “There is no religious denomination in which so much sin has been committed through the misuse of metaphorical expressions as in mathematics”. But what sins, and which misuses, was he criticizing in his writings on the philosophy of mathematics? Wittgenstein, (...) Finitism and the Foundations of Mathematics offers a fresh and illuminating way of approaching these basic questions about how to read Wittgenstein’s remarks on mathematics. (shrink)

Gentzen's three consistency proofs for elementary number theory have a common aim that originates from Hilbert's Program, namely, the aim to justify the application of classical reasoning to quantified propositions in elementary number theory. In addition to this common aim, Gentzen gave a “finitist” interpretation to every number-theoretic proposition with his 1935 and 1936 consistency proofs. In the present paper, we investigate the relationship of this interpretation with intuitionism in terms of the debate between the Hilbert School and the Brouwer (...) School over the significance of consistency proofs. First, we argue that the interpretation had the role of responding to a Brouwer-style objection against the significance of consistency proofs. Second, we propose a way of understanding Gentzen's response to this objection from an intuitionist perspective. (shrink)

David Hilbert's finitistic standpoint is a conception of elementary number theory designed to answer the intuitionist doubts regarding the security and certainty of mathematics. Hilbert was unfortunately not exact in delineating what that viewpoint was, and Hilbert himself changed his usage of the term through the 1920s and 30s. The purpose of this paper is to outline what the main problems are in understanding Hilbert and Bernays on this issue, based on some publications by them which have so far received (...) little attention, and on a number of philosophical reconstructions of the viewpoint (in particular, by Hand, Kitcher, and Tait). (shrink)

In biological terms, human consciousness appears as a feature associated with the func- tioning of the human brain. The corresponding activities of the neural network occur strictly in accord with physical laws; however, this fact does not necessarily imply that there can be a comprehensive scientific theory of conscious- ness, despite all the progress in neurobiology, neuropsychology and neurocomputation. Pre- dictions of the extent to which such a theory may become possible vary widely in the scien- tific community. There are (...) basic reasons - not only practical but also epistemological - why the brain-mind relation may never be fully “decod- able” by general finite procedures. In partic- ular self-referential features of consciousness, such as self-representations involved in strate- gic thought and dispositions, may not be resolv- able in all their essential aspects by brain analy- sis. Assuming that such limitations exist, objec- tive analysis by the methods of natural science cannot, in principle, fully encompass subjective, mental experience. (shrink)

Full applicability of physics to human biology does not necessarily imply that one can uncover a comprehensive, algorithmic correlation between physical brain states and corresponding mental states. The argument takes into account that information processing is finite in principle in a finite world. Presumbly the brain-mind-relation cannot be resolved in all essential aspects, particularly when high degrees of abstraction or self-analytical processes are involved. Our conjecture plausibly unifies the universal validity of physics and a logical limitation of human thought, and (...) it does not regard consciousness -the most basic human experience - as a marginal phenomenon. (shrink)

It is a commonplace of constructivist thought that a claim that an object of a certain kind exists is to be backed by an explicit display or exhibition of an object that is manifestly of that kind. Let us refer to this requirement as the exhibition condition. The main objective of this essay is to examine this requirement and to arrive at a better understanding of its epistemic character and the role that it plays in the two main constructivist philosophies (...) of this century---the intuitionist programme of Brouwer and Weyl, and the finitist programme of Hilbert. (shrink)

Various parallels between Kant's critical program and Hilbert's formalistic program for the philosophy of mathematics are considered.

It is argued that an instrumentalist notion of proof such as that represented in Hilbert's viewpoint is not obligated to satisfy the conservation condition that is generally regarded as a constraint on Hilbert's Program. A more reasonable soundness condition is then considered and shown not to be counter-exemplified by Godel's First Theorem. Finally, attention is given to the question of what a theory is; whether it should be seen as a "list" or corpus of beliefs, or as a method for (...) selecting beliefs. The significance of this question for assessing "intensional" results like Godel's Second Theorem, and their bearing on Hilbert's Program are discussed. (shrink)

In this paper I have considered various attempts to attribute significance to Gödel's second incompleteness theorem (G2 for short). Two of these attempts (Beth-Cohen and the position maintaining that G2 shows the failure of Hilbert's Program), I have argued, are false. Two others (an argument suggested by Beth, Cohen and ??? and Resnik's Interpretation), I argue, are groundless.

Greg Frost-Arnold’s book is a highly elegant edition and commentary of Carnap’s notes, claiming just as much as he is warranted on the basis of the manuscript and other relevant texts, and formulating his scholarly assumptions very carefully. Along the way he tries to unify the three historiographical strategies: narrative, argumentative and micro-historical.

At the most general level, the concept of finitism is typically characterized by saying that finitistic mathematics is that part of mathematics which does not appeal to completed infinite totalities and is endowed with some epistemological property that makes it secure or privileged. This paper argues that this characterization can in fact be sharpened in various ways, giving rise to different conceptions of finitism. The paper investigates these conceptions and shows that they sanction different portions of mathematics as finitistic.

There are some puzzles about G¨ odel’s published and unpublished remarks concerning finitism that have led some commentators to believe that his conception of it was unstable, that he oscillated back and forth between different accounts of it. I want to discuss these puzzles and argue that, on the contrary, G¨ odel’s writings represent a smooth evolution, with just one rather small double-reversal, of his view of finitism. He used the term “finit” (in German) or “finitary” or “finitistic” primarily to (...) refer to Hilbert’s conception of finitary mathematics. On two occasions (only, as far as I know), the lecture notes for his lecture at Zilsel’s [G¨ odel, 1938a] and the lecture notes for a lecture at Yale [G¨ odel, *1941], he used it in a way that he knew—in the second case, explicitly—went beyond what Hilbert meant. Early in his career, he believed that finitism (in Hilbert’s sense) is openended, in the sense that no correct formal system can be known to formalize all finitist proofs and, in particular, all possible finitist proofs of consistency of first-order number theory, P A; but starting in the Dialectica paper.. (shrink)

After a brief flirtation with logicism around 1917, David Hilbertproposed his own program in the foundations of mathematics in 1920 and developed it, in concert with collaborators such as Paul Bernays andWilhelm Ackermann, throughout the 1920s. The two technical pillars of the project were the development of axiomatic systems for everstronger and more comprehensive areas of mathematics, and finitisticproofs of consistency of these systems. Early advances in these areaswere made by Hilbert (and Bernays) in a series of lecture courses atthe (...) University of Göttingen between 1917 and 1923, and notably in Ackermann's dissertation of 1924. The main innovation was theinvention of the -calculus, on which Hilbert's axiom systemswere based, and the development of the -substitution methodas a basis for consistency proofs. The paper traces the developmentof the ``simultaneous development of logic and mathematics'' throughthe -notation and provides an analysis of Ackermann'sconsistency proofs for primitive recursive arithmetic and for thefirst comprehensive mathematical system, the latter using thesubstitution method. It is striking that these proofs use transfiniteinduction not dissimilar to that used in Gentzen's later consistencyproof as well as non-primitive recursive definitions, and that thesemethods were accepted as finitistic at the time. (shrink)

Detlefsen (1986) reads Hilbert's program as a sophisticated defense of instrumentalism, but Feferman (1998) has it that Hilbert's program leaves significant ontological questions unanswered. One such question is of the reference of individual number terms. Hilbert's use of admittedly "meaningless" signs for numbers and formulae appears to impair his ability to establish the reference of mathematical terms and the content of mathematical propositions (Weyl (1949); Kitcher (1976)). The paper traces the history and context of Hilbert's reasoning about signs, which illuminates (...) Hilbert's account of mathematical objectivity, axiomatics, idealization, and consistency. (shrink)

Context: Strict finitism is usually not taken seriously as a possible view on what mathematics is and how it functions. This is due mainly to unfamiliarity with the topic. Problem: First, it is necessary to present a “decent” history of strict finitism (which is now lacking) and, secondly, to show that common counterarguments against strict finitism can be properly addressed and refuted. Method: For the historical part, the historical material is situated in a broader context, and for the argumentative part, (...) an evaluation of arguments and counterarguments is presented. Results: The main result is that strict finitism is indeed a viable option, next to other constructive approaches, in (the foundations of) mathematics. Implications: Arguing for strict finitism is more complex than is usually thought. For future research, strict finitist mathematics itself needs to be written out in more detail to increase its credibility. In as far as strict finitism is a viable option, it will change our views on such “classics” as the platonist-constructivist discussion, the discovery-construction debate and the mysterious applicability problem (why is mathematics so successful in its applications?). Constructivist content: Strict finitism starts from the idea that counting is an act of labeling, hence the mathematician is an active subject right from the start. It differs from other constructivist views in that the finite limitations of the human subject are taken into account. (shrink)

Herein is presented a natural first-order arithmetic system which can prove its own consistency, both in the weaker Godelian sense using traditional Godel numbering and, more importantly, in a more robust and direct sense; yet it is strong enough to prove many arithmetic theorems, including the Euclidean Algorithm, Quadratic Reciprocity, and Bertrand’s Postulate.