In Search of the Roots of Formal Computation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

In Search of the Roots of Formal Computation


In a culmination of a long development, it was seen clearly in the early 1930s that steps of formal computation are also steps of formal deduction as defined by recursion equations and other similar principles of arithmetic. Followers of Kant’s doctrine of the synthetic a priori in arithmetic missed by a hair’s breadth the proper recursive definition of addition that appeared instead first in a book of Hermann Grassmann of 1861. A line can be followed from it to Hankel, Schröder, Dedekind, Peano, and Skolem, the last mentioned marking the birth of recursive arithmetic, a discipline firmly anchored in the foundations of mathematics by the presentation Paul Bernays made of it in his monument, the Grundlagen der Mathematik of 1934.
Fichier principal
Vignette du fichier
432590_1_En_21_Chapter.pdf (119.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01615300 , version 1 (12-10-2017)





Jan Von Plato. In Search of the Roots of Formal Computation. 3rd International Conference on History and Philosophy of Computing (HaPoC), Oct 2015, Pisa, Italy. pp.300-320, ⟨10.1007/978-3-319-47286-7_21⟩. ⟨hal-01615300⟩
38 View
191 Download



Gmail Facebook Twitter LinkedIn More