See transfinite induction in All languages combined, or Wiktionary
Download JSON data for transfinite induction meaning in English (4.5kB)
{
"forms": [
{
"form": "transfinite inductions",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "transfinite induction (plural transfinite inductions)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Set theory",
"orig": "en:Set theory",
"parents": [
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"examples": [
{
"ref": "1967, Kam-Tim Leung, Doris Lai-chue Chen, Elementary Set Theory, Parts I and II, Hong Kong University Press, page 108",
"text": "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.",
"type": "quotation"
},
{
"text": "1970 [Addison-Wesley], Howard DeLong, A Profile of Mathematical Logic, Dover, 2004, page 218,\nJust 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 ε₀."
},
{
"ref": "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",
"text": "The published version of 1936 had a different proof based on the famous principle of transfinite induction up to the ordinal #x5C;varepsilon#x5F;0 by which consistency followed. A third proof of 1938 used transfinite induction but the logical system was a sequent calculus.",
"type": "quotation"
}
],
"glosses": [
"An extension of mathematical induction to well-ordered sets of transfinite cardinality, such as sets of ordinal numbers or cardinal numbers."
],
"hyponyms": [
{
"sense": "extension of mathematical induction to well-ordered sets of transfinite cardinality",
"word": "ε-induction"
},
{
"sense": "extension of mathematical induction to well-ordered sets of transfinite cardinality",
"word": "epsilon-induction"
}
],
"id": "en-transfinite_induction-en-noun-fGpCyDC0",
"links": [
[
"mathematics",
"mathematics"
],
[
"set theory",
"set theory"
],
[
"mathematical induction",
"mathematical induction"
],
[
"well-ordered",
"well-ordered"
],
[
"set",
"set"
],
[
"cardinality",
"cardinality"
],
[
"ordinal number",
"ordinal number"
],
[
"cardinal number",
"cardinal number"
]
],
"raw_glosses": [
"(mathematics, set theory) An extension of mathematical induction to well-ordered sets of transfinite cardinality, such as sets of ordinal numbers or cardinal numbers."
],
"related": [
{
"word": "transfinite number"
},
{
"word": "transfinite recursion"
},
{
"word": "well-founded relation"
}
],
"synonyms": [
{
"sense": "extension of mathematical induction to well-ordered sets of transfinite cardinality",
"word": "Noetherian induction"
},
{
"sense": "extension of mathematical induction to well-ordered sets of transfinite cardinality",
"word": "structural induction"
},
{
"sense": "extension of mathematical induction to well-ordered sets of transfinite cardinality",
"word": "well-founded induction"
}
],
"topics": [
"mathematics",
"sciences",
"set-theory"
],
"translations": [
{
"code": "de",
"lang": "German",
"sense": "extension of mathematical induction to well-ordered sets of transfinite cardinality",
"tags": [
"feminine"
],
"word": "transfinite Induktion"
},
{
"code": "it",
"lang": "Italian",
"sense": "extension of mathematical induction to well-ordered sets of transfinite cardinality",
"tags": [
"feminine"
],
"word": "induzione transfinita"
},
{
"code": "pt",
"lang": "Portuguese",
"sense": "extension of mathematical induction to well-ordered sets of transfinite cardinality",
"tags": [
"feminine"
],
"word": "indução transfinita"
}
],
"wikipedia": [
"transfinite induction"
]
}
],
"word": "transfinite induction"
}
{
"forms": [
{
"form": "transfinite inductions",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "transfinite induction (plural transfinite inductions)",
"name": "en-noun"
}
],
"hyponyms": [
{
"sense": "extension of mathematical induction to well-ordered sets of transfinite cardinality",
"word": "ε-induction"
},
{
"sense": "extension of mathematical induction to well-ordered sets of transfinite cardinality",
"word": "epsilon-induction"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"word": "transfinite number"
},
{
"word": "transfinite recursion"
},
{
"word": "well-founded relation"
}
],
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"English terms with quotations",
"en:Mathematics",
"en:Set theory"
],
"examples": [
{
"ref": "1967, Kam-Tim Leung, Doris Lai-chue Chen, Elementary Set Theory, Parts I and II, Hong Kong University Press, page 108",
"text": "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.",
"type": "quotation"
},
{
"text": "1970 [Addison-Wesley], Howard DeLong, A Profile of Mathematical Logic, Dover, 2004, page 218,\nJust 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 ε₀."
},
{
"ref": "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",
"text": "The published version of 1936 had a different proof based on the famous principle of transfinite induction up to the ordinal #x5C;varepsilon#x5F;0 by which consistency followed. A third proof of 1938 used transfinite induction but the logical system was a sequent calculus.",
"type": "quotation"
}
],
"glosses": [
"An extension of mathematical induction to well-ordered sets of transfinite cardinality, such as sets of ordinal numbers or cardinal numbers."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"set theory",
"set theory"
],
[
"mathematical induction",
"mathematical induction"
],
[
"well-ordered",
"well-ordered"
],
[
"set",
"set"
],
[
"cardinality",
"cardinality"
],
[
"ordinal number",
"ordinal number"
],
[
"cardinal number",
"cardinal number"
]
],
"raw_glosses": [
"(mathematics, set theory) An extension of mathematical induction to well-ordered sets of transfinite cardinality, such as sets of ordinal numbers or cardinal numbers."
],
"topics": [
"mathematics",
"sciences",
"set-theory"
],
"wikipedia": [
"transfinite induction"
]
}
],
"synonyms": [
{
"sense": "extension of mathematical induction to well-ordered sets of transfinite cardinality",
"word": "Noetherian induction"
},
{
"sense": "extension of mathematical induction to well-ordered sets of transfinite cardinality",
"word": "structural induction"
},
{
"sense": "extension of mathematical induction to well-ordered sets of transfinite cardinality",
"word": "well-founded induction"
}
],
"translations": [
{
"code": "de",
"lang": "German",
"sense": "extension of mathematical induction to well-ordered sets of transfinite cardinality",
"tags": [
"feminine"
],
"word": "transfinite Induktion"
},
{
"code": "it",
"lang": "Italian",
"sense": "extension of mathematical induction to well-ordered sets of transfinite cardinality",
"tags": [
"feminine"
],
"word": "induzione transfinita"
},
{
"code": "pt",
"lang": "Portuguese",
"sense": "extension of mathematical induction to well-ordered sets of transfinite cardinality",
"tags": [
"feminine"
],
"word": "indução transfinita"
}
],
"word": "transfinite induction"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-10 from the enwiktionary dump dated 2024-05-02 using wiktextract (a644e18 and edd475d). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.