Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Limit ordinal
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Infinite ordinal number class}}[[File:Omega-exp-omega-normal-dark svg.svg|thumb|250px|Representation of the ordinal numbers up to ω<sup>ω</sup>. Each turn of the spiral represents one power of ω. Limit ordinals are those that are non-zero and have no predecessor, such as ω or ω<sup>2</sup> ]] In [[set theory]], a '''limit ordinal''' is an [[ordinal number]] that is neither zero nor a [[successor ordinal]]. Alternatively, an ordinal 位 is a limit ordinal if there is an ordinal less than 位, and whenever 尾 is an ordinal less than 位, then there exists an ordinal 纬 such that 尾 < 纬 < 位. Every ordinal number is either zero, a successor ordinal, or a limit ordinal. For example, the smallest limit ordinal is [[蠅 (ordinal number)|蠅]], the smallest ordinal greater than every [[natural number]]. This is a limit ordinal because for any smaller ordinal (i.e., for any natural number) ''n'' we can find another natural number larger than it (e.g. ''n''+1), but still less than 蠅. The next-smallest limit ordinal is 蠅+蠅. This will be discussed further in the article. Using the [[von Neumann definition of ordinals]], every ordinal is the [[well-ordered set]] of all smaller ordinals. The union of a nonempty set of ordinals that has no [[greatest element]] is then always a limit ordinal. Using [[von Neumann cardinal assignment]], every infinite [[cardinal number]] is also a limit ordinal.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)