Live briefing
Everything about Transfinite recursion theorem
Mathematical theorem
In mathematics, the transfinite recursion theorem says a function can be defined using a recursion over a well-ordered set; for example, but also over general well-ordered sets. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Transfinite recursion theoremA 5-minute orientation
- Pick up a classic book: There's something about Gödel!The most-reprinted book on the subject
- Read the landmark paper: A recursion theorem for predicate transformers on inductive data typesCited 4 times
- Go sideways: Transfinite inductionA closely related topic
- Go sideways: Zorn's lemmaA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
- 📕There's something about Gödel!Francesco Berto · 2009
- 📕There's something about GödelFrancesco Berto · 2009
- 📕There's something about GödelFrancesco Berto · 2009
- 📕The mathematics of infinityTheodore G. Faticoni · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Transfinite induction Transfinite induction is an extension of mathematical induction to ordinal numbers. Its correctness is a theorem of ZF, and relies on the fact that the…
- Zorn's lemma Zorn's lemma, also known as the Kuratowski–Zorn lemma, is a proposition of set theory. It states that a partially ordered set containing upper bounds for…
- Bourbaki–Witt theorem In mathematics, the Bourbaki–Witt theorem in order theory, named after Nicolas Bourbaki and Ernst Witt, is a basic fixed-point theorem for partially ordered…
- Well-ordering theorem In mathematics, the well-ordering theorem, also known as Zermelo's theorem, states that every set can be well-ordered. A set X is well-ordered by a strict…
- Ordinal number In set theory, an ordinal number, or ordinal, is a generalization of ordinal numerals (first, second, nth, etc.) aimed to extend enumeration to infinite…
- Hausdorff maximal principle In mathematics, the Hausdorff maximal principle is an alternate and earlier formulation of Zorn's lemma proved by Felix Hausdorff in 1914. It states that…
- Well-order In mathematics, a well-order (or well-ordering or well-order relation) on a set S is a total ordering on S with the property that every non-empty subset…
- Well-founded relation In mathematics, a binary relation R is called well-founded (or wellfounded or foundational) on a set or, more generally, a class X if every non-empty subset…