Iterable cardinal
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, an iterable cardinal is a type of large cardinal introduced by , and , and further studied by . Sharpe and Welch defined a cardinal κ to be iterable if every subset of κ is contained in a weak κ-model M for which there exists an M-ultrafilter on κ which allows for wellfounded iterations by ultrapowers of arbitrary length. Gitman gave a finer notion, where a cardinal κ is defined to be α-iterable if ultrapower iterations only of length α are required to wellfounded. (By standard arguments iterability is equivalent to ω 1 -iterability.)
In mathematics, an iterable cardinal is a type of large cardinal introduced by , and , and further studied by . Sharpe and Welch defined a cardinal κ to be iterable if every subset of κ is contained in a weak κ-model M for which there exists an M-ultrafilter on κ which allows for wellfounded iterations by ultrapowers of arbitrary length. Gitman gave a finer notion, where a cardinal κ is defined to be α-iterable if ultrapower iterations only of length α are required to wellfounded. (By standard arguments iterability is equivalent to ω 1 -iterability.)
References
External links
Diagram of iterable cardinals
Text derived from https://en.wikipedia.org/w/index.php?oldid=1358238832 under CC BY-SA 4.0; modifications have been made.