Skip to content
ontologydriven
Sign out

Dictionary

Words, grammatical forms and meanings linked to the ontology.

transfinite induction en · NOUN

Meanings

  1. An extension of mathematical induction to well-ordered sets of transfinite cardinality, such as sets of ordinal numbers or cardinal numbers.
    • 1970 [Addison-Wesley], Howard DeLong, A Profile of Mathematical Logic, Dover, 2004, page 218, Just what kinds of transfinite inductions are to be considered finitary is debatable. Transfinite induction up to an arbitrary ordinal is certainly not finitary. However, it can be shown that certain transfinite inductions are reducible to ordinary mathematical inductions. For example, induction up to ω^ω is reducible to ordinary induction. Gentzen in his proof used transfinite induction up to ε₀.
    • The published version of 1936 had a different proof based on the famous principle of transfinite induction up to the ordinal #92;varepsilon#95;0 by which consistency^([of Peano arithmetic]) followed. A third proof of 1938 used transfinite induction but the logical system was a sequent calculus. 2009, Jan von Plato, “Gentzen's Logic”, in Dov M. Gabbay, John Woods, editors, Handbook of the History of Logic, Volume 5: Logic from Russell to Church, Elsevier (North-Holland), page 667:
    • The validity of the principle of transfinite induction for well-ordered sets enables us to carry out proofs by transfinite induction and definitions by transfinite induction. A proof by transfinite induction is a direct application of the principle when it is required to show that each element of a well-ordered set A has a property P.[…]To understand the method of definition by transfinite induction some preparation is necessary. 1967, Kam-Tim Leung, Doris Lai-chue Chen, Elementary Set Theory, Parts I and II, Hong Kong University Press, page 108:

Forms

SpellingFeaturesLabelsSource
transfinite inductions Number=Plur lexicographic

Hyponyms

epsilon-induction (extension of mathematical induction to well-ordered sets of transfinite cardinality) · ε-induction (extension of mathematical induction to well-ordered sets of transfinite cardinality)

Relateds

transfinite number · well-founded relation · transfinite recursion

Synonyms

structural induction (extension of mathematical induction to well-ordered sets of transfinite cardinality) · Noetherian induction (extension of mathematical induction to well-ordered sets of transfinite cardinality) · well-founded induction (extension of mathematical induction to well-ordered sets of transfinite cardinality)

Translations (4)

de transfinite Induktion (extension of mathematical induction to well-ordered sets of transfinite cardinality) · hu transzfinit indukció (extension of mathematical induction to well-ordered sets of transfinite cardinality) · pt indução transfinita (extension of mathematical induction to well-ordered sets of transfinite cardinality) · it induzione transfinita (extension of mathematical induction to well-ordered sets of transfinite cardinality)