Computability and Decidability

In The Code of Mathematics: Proof and Truth. Berlin, Heidelberg: Springer Berlin Heidelberg. pp. 65-75 (2024)
  Copy   BIBTEX

Abstract

The idea of recursionRecursion and complete inductionComplete induction is very old. But it was not until the 19th century that Richard DedekindDedekind, Richard with his books “Continuity and irrational numbers” and “What are and what should the numbers be?” established the fundamental properties of natural numbers on a solid foundation and defined the construction of the number system with integers, rational and real numbers from natural numbers. One of his most important achievements was the discovery and proof of the recursion theoremRecursion.

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2025-06-23

Downloads
17 (#1,901,455)

6 months
9 (#1,255,287)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references