Inaccessible cardinal¶

A strongly inaccessible cardinal is an uncountable regular strong-limit cardinal; in modern usage, the unqualified term inaccessible cardinal normally denotes this strong form.

Version: v1 · 2026-09-28 · History
Domain-specific #: 10013
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Set Theory, Large Cardinals → Mathematics

Core Idea¶

Inaccessible cardinal is treated here as the recurring mathematics_logic_statistics identity summarized by this source-grounded definition: A strongly inaccessible cardinal is an uncountable regular strong-limit cardinal; in modern usage, the unqualified term inaccessible cardinal normally denotes this strong form.

In set theory, a cardinal number is a strongly inaccessible cardinal if it is uncountable, regular, and a strong limit cardinal. A cardinal is a weakly inaccessible cardinal if it is uncountable, regular, and a weak limit cardinal. Since about 1950, "inaccessible cardinal" has typically meant "strongly inaccessible cardinal" whereas before it had meant "weakly inaccessible cardinal".

Strongly inaccessible cardinals were introduced by and ; in the latter they were referred to along with \aleph_0 as Grenzzahlen (English "limit numbers"). Every strongly inaccessible cardinal is a weakly inaccessible cardinal. The generalized continuum hypothesis implies that all weakly inaccessible cardinals are strongly inaccessible as well.

For Inaccessible cardinal, the abstraction is narrower than the article's general subject matter: a positive case must preserve In set theory, a cardinal number is a strongly inaccessible cardinal if it is uncountable, regular, and a strong limit cardinal. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in mathematics_logic_statistics, which is why this identity is domain-specific rather than prime.

Structural Signature¶

Sig role-phrases:

Defining carrier — Def(V_\kappa) is one of the intended models of Mendelson's version of Von Neumann–Bernays–Gödel set theory which excludes global choice, replacing limitation of size by replacement and ordinary choice.
Constitutive relation — For example, denote by \psi_0(\lambda) the \lambda th inaccessible cardinal, then the fixed points of \psi_0 are the 1-inaccessible cardinals.
Operating condition — This process of taking fixed points of functions generating successively larger cardinals is commonly encountered in the study of large cardinal numbers.
Recognition evidence — In this case, by the reflection property above, there exists \alpha such that (V_\alpha,\in) is a standard model of (first order) ZFC.
Admissible variation — One such argument, presented by , is that the class of all ordinals of a particular model M of set theory would itself be an inaccessible cardinal if there was a larger model of set theory extending M and preserving powerset of elements of M.
Characteristic consequence — Strongly inaccessible cardinals were introduced by and ; in the latter they were referred to along with \aleph_0 as Grenzzahlen (English "limit numbers").
Failure boundary — Zermelo–Fraenkel set theory with Choice (ZFC) implies that the \kappa th level of the Von Neumann universe V_\kappa is a model of ZFC whenever \kappa is strongly inaccessible.

What It Is Not¶

Not the whole field of mathematics_logic_statistics. The node requires the specific identity stated by In set theory, a cardinal number is a strongly inaccessible cardinal if it is uncountable, regular, and a strong limit cardinal.
Not an over-broad reading. It is worth pointing out that the first claim can be weakened: \kappa does not need to be inaccessible, or even a cardinal number, in order for V_\kappa to be a standard model of ZF (see below).
Not an over-broad reading. The proof sketched in the previous paragraph that the consistency of ZFC implies the consistency of ZFC + "there is not an inaccessible cardinal" can be formalized in ZFC.
Not an over-broad reading. However, assuming that ZFC is consistent, no proof that the consistency of ZFC implies the consistency of ZFC + "there is an inaccessible cardinal" can be formalized in ZFC.
Not automatically Remarkable Cardinal. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Inaccessible cardinal applies literally inside mathematics_logic_statistics wherever the source-defined carrier and relation can be established. Its documented habitats include:

Existence of a proper class of inaccessibles. The axioms of ZFC along with the universe axiom (or equivalently the inaccessible cardinal axiom) are denoted ZFCU (not to be confused with ZFC with urelements).
Existence of a proper class of inaccessibles. The \alpha -inaccessible cardinals can also be described as fixed points of functions which count the lower inaccessibles.
Existence of a proper class of inaccessibles. This process of taking fixed points of functions generating successively larger cardinals is commonly encountered in the study of large cardinal numbers.
Existence of a proper class of inaccessibles. (It can never be \kappa + 1 -inaccessible.) It is occasionally used to mean Mahlo cardinal.
Models and consistency. Zermelo–Fraenkel set theory with Choice (ZFC) implies that the \kappa th level of the Von Neumann universe V_\kappa is a model of ZFC whenever \kappa is strongly inaccessible.
Models and consistency. Furthermore, ZF implies that the Gödel universe L_\kappa is a model of ZFC whenever \kappa is weakly inaccessible.

Outside mathematics_logic_statistics, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Pattern or should be marked as analogy.

Clarity¶

A clear use of Inaccessible cardinal names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In set theory, a cardinal number is a strongly inaccessible cardinal if it is uncountable, regular, and a strong limit cardinal. The strongest recognition evidence in the frozen account is: In this case, by the reflection property above, there exists \alpha such that (V_\alpha,\in) is a standard model of (first order) ZFC. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification It is worth pointing out that the first claim can be weakened: \kappa does not need to be inaccessible, or even a cardinal number, in order for V_\kappa to be a standard model of ZF (see below). so that a reader can reproduce the classification rather than infer it from topical resemblance.

Manages Complexity¶

Inaccessible cardinal compresses multiple mathematics_logic_statistics details into a stable diagnostic relation. The source shows both the central mechanism—for example, denote by \psi_0(\lambda) the \lambda th inaccessible cardinal, then the fixed points of \psi_0 are the 1-inaccessible cardinals.—and the practical consequence—strongly inaccessible cardinals were introduced by and ; in the latter they were referred to along with \aleph_0 as Grenzzahlen (English "limit numbers"). This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the mathematics_logic_statistics entities to which the claim applies.
State the relation. Use the source-grounded identity: In set theory, a cardinal number is a strongly inaccessible cardinal if it is uncountable, regular, and a strong limit cardinal.
Check operation and conditions. This process of taking fixed points of functions generating successively larger cardinals is commonly encountered in the study of large cardinal numbers.
Demand recognition evidence. In this case, by the reflection property above, there exists \alpha such that (V_\alpha,\in) is a standard model of (first order) ZFC.
Test variation. Change an implementation or setting while preserving one such argument, presented by , is that the class of all ordinals of a particular model M of set theory would itself be an inaccessible cardinal if there was a larger model of set theory extending M and preserving powerset of elements of M.
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Pattern.

Knowledge Transfer¶

Within the home domain. Knowledge about Inaccessible cardinal transfers literally when a new case preserves the same carrier type, relation, and recognition test. The axioms of ZFC along with the universe axiom (or equivalently the inaccessible cardinal axiom) are denoted ZFCU (not to be confused with ZFC with urelements). The \alpha -inaccessible cardinals can also be described as fixed points of functions which count the lower inaccessibles.

Beyond the home domain. No canonical parent is asserted for Inaccessible cardinal. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

In the case of inaccessibility, the corresponding axiom is the assertion that for every cardinal \mu , there is an inaccessible cardinal \kappa which is strictly larger, \mu. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → In set theory, a cardinal number is a strongly inaccessible cardinal if it is uncountable, regular, and a strong limit cardinal; recognition evidence → In this case, by the reflection property above, there exists \alpha such that (V_\alpha,\in) is a standard model of (first order) ZFC

Applied / In Practice¶

As is the case for the existence of any inaccessible cardinal, the inaccessible cardinal axiom is unprovable from the axioms of ZFC. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → Existence of a proper class of inaccessibles; invariant → In set theory, a cardinal number is a strongly inaccessible cardinal if it is uncountable, regular, and a strong limit cardinal; boundary → the case exits the class when it is worth pointing out that the first claim can be weakened: \kappa does not need to be inaccessible, or even a cardinal number, in order for V_\kappa to be a standard model of ZF (see below)

Structural Tensions¶

T1 — Stable identity versus admissible variation. It is worth pointing out that the first claim can be weakened: \kappa does not need to be inaccessible, or even a cardinal number, in order for V_\kappa to be a standard model of ZF (see below). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. The proof sketched in the previous paragraph that the consistency of ZFC implies the consistency of ZFC + "there is not an inaccessible cardinal" can be formalized in ZFC. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. However, assuming that ZFC is consistent, no proof that the consistency of ZFC implies the consistency of ZFC + "there is an inaccessible cardinal" can be formalized in ZFC. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. The term " \alpha -inaccessible cardinal" is ambiguous and different authors use inequivalent definitions. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. Def(V_\kappa) is one of the intended models of Mendelson's version of Von Neumann–Bernays–Gödel set theory which excludes global choice, replacing limitation of size by replacement and ordinary choice. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Inaccessible cardinal literally, co-instantiate Pattern, or only resemble it?

T6 — Autonomy versus reduction. For example, denote by \psi_0(\lambda) the \lambda th inaccessible cardinal, then the fixed points of \psi_0 are the 1-inaccessible cardinals. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Inaccessible cardinal distinguish that the broader parent Pattern leaves together?

Structural–Framed Character¶

Inaccessible cardinal is structural-leaning. Its structural side is the repeatable organization summarized by In set theory, a cardinal number is a strongly inaccessible cardinal if it is uncountable, regular, and a strong limit cardinal. Its framed side is the mathematics_logic_statistics vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: This process of taking fixed points of functions generating successively larger cardinals is commonly encountered in the study of large cardinal numbers. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Pattern. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. A strongly inaccessible cardinal is an uncountable regular strong-limit cardinal; in modern usage, the unqualified term inaccessible cardinal normally denotes this strong form. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: Def(V\kappa) is one of the intended models of Mendelson's version of Von Neumann–Bernays–Gödel set theory which excludes global choice, replacing limitation of size by replacement and ordinary choice. For example, denote by \psi0(\lambda) the \lambda th inaccessible cardinal, then the fixed points of \psi0 are the 1-inaccessible cardinals. It further constrains recognition and variation through: This process of taking fixed points of functions generating successively larger cardinals is commonly encountered in the study of large cardinal numbers. In this case, by the reflection property above, there exists \alpha such that (V\alpha,\in) is a standard model of (first order) ZFC.

What is domain-bound. mathematics logic statistics supplies the operative entities, technical vocabulary, warrants, and exceptions that make Inaccessible cardinal literal. Its documented scope includes the condition that The axioms of ZFC along with the universe axiom (or equivalently the inaccessible cardinal axiom) are denoted ZFCU (not to be confused with ZFC with urelements). Another bounded application condition is that The \alpha -inaccessible cardinals can also be described as fixed points of functions which count the lower inaccessibles. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—One such argument, presented by , is that the class of all ordinals of a particular model M of set theory would itself be an inaccessible cardinal if there was a larger model of set theory extending M and preserving powerset of elements of M.—and future graph densification may discover a defensible relation only if it preserves that boundary.

This entry is a kind of Cardinality.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Inaccessible cardinal. The reviewed identity is: A strongly inaccessible cardinal is an uncountable regular strong-limit cardinal; in modern usage, the unqualified term inaccessible cardinal normally denotes this strong form. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Relationships to Other Abstractions¶

Current abstraction Inaccessible cardinal Domain-specific

Parents (1) — more general patterns this builds on

Inaccessible cardinal is a kind of Cardinality Prime

An inaccessible cardinal is a cardinal number distinguished by uncountability, regularity, and strong-limit conditions; Cardinal Number is a declared alias of the live Cardinality Prime.

Children (1) — more specific cases that build on this

Huge Cardinal Domain-specific is a kind of Inaccessible cardinal

A huge cardinal is strongly inaccessible under ZFC at the same critical-point cardinal.

Hierarchy paths (5) — routes to 3 parentless roots

Inaccessible cardinal → Cardinality → Bijectivity → Function (Mapping)

Show alternative paths (4)

Neighborhood in Abstraction Space¶

Inaccessible cardinal sits in a moderately populated region (43^rd percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Named Analytic Theorems & Operators (39 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Pattern. The parent omits the specialist differentia. Tell: Can the case establish In set theory, a cardinal number is a strongly inaccessible cardinal if it is uncountable, regular, and a strong limit cardinal?
Remarkable Cardinal. A virtual large cardinal κ for which arbitrarily high ground-model rank or hereditary-size segments admit, in set-forcing extensions, elementary small embeddings whose critical point is mapped to κ. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Cardinality. Size of sets. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Finite set. A set equipotent with the natural numbers below some n, equivalently one whose elements can be completely counted and assigned a natural-number cardinality. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Inaccessible cardinal remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside mathematics_logic_statistics lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Pattern?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Inaccessible_cardinal (revision 1369414153).
Preserved source candidate: https://math.bu.edu/people/aki/10.pdf
Preserved source candidate: https://mathoverflow.net/questions/437195/does-anyone-still-seriously-doubt-the-consistency-of-zfc
Preserved source candidate: https://www.jstor.org/stable/26788522
Preserved source candidate: https://gdz.sub.uni-goettingen.de/id/PPN235181684_0065?tify={%22pages%22:[453
Preserved source candidate: http://matwbn.icm.edu.pl/ksiazki/fm/fm15/fm15129.pdf
Preserved source candidate: http://matwbn.icm.edu.pl/ksiazki/fm/fm16/fm1615.pdf

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.