Finitistic induction

Finitistic induction

Finitistic induction is a limited form of mathematical induction in which it can be shown that the inductive process concludes its extension in a finite number of steps.

An extreme form of the constructivist stance in the philosophy of mathematics, finitism proposes that a mathematical object (i.e. a well defined abstract entity capable of possessing properties and bearing relations) does not exist unless it can be "constructed" by a formal procedure from the natural numbers in a finite number of steps. (In contrast, most constructivists allow for the existence of objects constructed in a countably infinite number of steps.)

Kurt Gödel's first incompleteness theorem related to the limits of systems restricted to finitistic inductive means.


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • List of mathematics articles (F) — NOTOC F F₄ F algebra F coalgebra F distribution F divergence Fσ set F space F test F theory F. and M. Riesz theorem F1 Score Faà di Bruno s formula Face (geometry) Face configuration Face diagonal Facet (mathematics) Facetting… …   Wikipedia

  • Peano axioms — In mathematical logic, the Peano axioms, also known as the Dedekind Peano axioms or the Peano postulates, are a set of axioms for the natural numbers presented by the 19th century Italian mathematician Giuseppe Peano. These axioms have been used… …   Wikipedia

  • Hilbert's second problem — In mathematics, Hilbert s second problem was posed by David Hilbert in 1900 as one of his 23 problems. It asks for a proof that arithmetic of real numbers is consistent.In the 1930s, Kurt Gödel and Gerhard Gentzen proved results that cast new… …   Wikipedia

  • Dialectica interpretation — In proof theory, the Dialectica interpretation [1] is a proof interpretation of intuitionistic arithmetic (Heyting arithmetic) into a finite type extension of primitive recursive arithmetic, the so called System T. It was developed by Kurt Gödel… …   Wikipedia

  • Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… …   Wikipedia

  • Hilbert's program — Hilbert s program, formulated by German mathematician David Hilbert in the 1920s, was to formalize all existing theories to a finite, complete set of axioms, and provide a proof that these axioms were consistent.Hilbert proposed that the… …   Wikipedia

  • Certainty — series Agnosticism Belief Certainty Doubt Determinism Epistemology Estimation Fallibilism …   Wikipedia

  • Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… …   Wikipedia

  • History of logic — Philosophy ( …   Wikipedia

  • Set theory — This article is about the branch of mathematics. For musical set theory, see Set theory (music). A Venn diagram illustrating the intersection of two sets. Set theory is the branch of mathematics that studies sets, which are collections of objects …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”