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 cardinal
(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!
== The notion of inaccessibility and large cardinals == The preceding defines a notion of "inaccessibility": we are dealing with cases where it is no longer enough to do finitely many iterations of the successor and powerset operations; hence the phrase "cannot be reached" in both of the intuitive definitions above. But the "union operation" always provides another way of "accessing" these cardinals (and indeed, such is the case of limit ordinals as well). Stronger notions of inaccessibility can be defined using [[cofinality]]. For a weak (respectively strong) limit cardinal ''κ'' the requirement is that cf(''κ'') = ''κ'' (i.e. ''κ'' be [[regular cardinal|regular]]) so that ''κ'' cannot be expressed as a sum (union) of fewer than ''κ'' smaller cardinals. Such a cardinal is called a [[inaccessible cardinal|weakly (respectively strongly) inaccessible cardinal]]. The preceding examples both are singular cardinals of cofinality ω and hence they are not inaccessible. <math>\aleph_0</math> would be an inaccessible cardinal of both "strengths" except that the definition of inaccessible requires that they be uncountable. Standard Zermelo–Fraenkel set theory with the axiom of choice (ZFC) cannot even prove the consistency of the existence of an inaccessible cardinal of either kind above <math>\aleph_0</math>, due to [[Gödel's incompleteness theorem]]. More specifically, if <math>\kappa</math> is weakly inaccessible then <math>L_{\kappa} \models ZFC</math>. These form the first in a hierarchy of [[large cardinal]]s.
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)