Live briefing
Everything about Ordinal collapsing function
Set-theoretic function
In mathematical logic and set theory, an ordinal collapsing function is a technique for defining certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger than the one being defined, perhaps even large cardinals, and then "collapse" them down to a system of notations for the sought-after ordinal. For this reason, ordinal collapsing functions are described as an impredicative manner of naming ordinals. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Ordinal collapsing functionA 5-minute orientation
- Pick up a classic book: Ten epochs of church historyThe most-reprinted book on the subject
- Go sideways: Buchholz psi functionsA closely related topic
- Go sideways: Ordinal notationA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
- No matching papers found.
📚 Books worth reading
Ten epochs of church historyFulton, John, 1834-1907, Locke, Clinton, 1829-1904 · 1879
The life of Jean-Jacques OlierEdward Healy Thompson · 1885
Major Bob KhathingH. Bhuban Singh · 1992- 📕Learning statistics with JamoviDanielle J. Navarro, David R. Foxcroft · 2025
- 📕The effect of foreign intervention on Somali conflict in Mogadishu, Somalia · 2014
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Buchholz psi functions Buchholz's psi-functions are a hierarchy of single-argument ordinal functions ψν(α) introduced by German mathematician Wilfried Buchholz in 1986. These…
- Ordinal notation In mathematical logic and set theory, an ordinal notation is a partial function mapping the set of all finite sequences of symbols, themselves members…
- Large countable ordinal In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non-circularl…
- Ordinal arithmetic In the mathematical field of set theory, ordinal arithmetic includes binary operations on ordinal numbers such as addition, multiplication, and exponentiation…
- Epsilon number In mathematics, the epsilon numbers are a collection of transfinite numbers whose defining property is that they are fixed points of an exponential map…
- Veblen function In mathematics, the Veblen functions are a hierarchy of normal functions (continuous strictly increasing functions from ordinals to ordinals), introduced…
- Rathjen's psi function In mathematics, Rathjen's ψ psi function is an ordinal collapsing function developed by Michael Rathjen. It collapses weakly Mahlo cardinals M to generate…
- 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…