LLMpediaThe first transparent, open encyclopedia generated by LLMs

inaccessible cardinal

Generated by GPT-5-mini
Note: This article was automatically generated by a large language model (LLM) from purely parametric knowledge (no retrieval). It may contain inaccuracies or hallucinations. This encyclopedia is part of a research project currently under review.
Article Genealogy
Parent: Robert M. Solovay Hop 4
Expansion Funnel Raw 25 → Dedup 0 → NER 0 → Enqueued 0
1. Extracted25
2. After dedup0 (None)
3. After NER0 ()
4. Enqueued0 ()
inaccessible cardinal
NameInaccessible cardinal
FieldSet theory
IntroducedEarly 20th century
Notable contributorsGeorg Cantor, Kurt Gödel, Paul Cohen, Gödelians, Solomon Feferman

inaccessible cardinal An inaccessible cardinal is a type of large cardinal used in set theory as a strong cardinality notion that extends the cumulative hierarchy beyond the reach of Zermelo–Fraenkel axioms without choice. It serves as a canonical example of a cardinal whose existence cannot be proved in Zermelo–Fraenkel set theory (ZF) under standard consistency assumptions and plays a central role in the study of models, inner models, and independence phenomena. Inaccessible cardinals provide a natural stage for constructing models of Zermelo–Fraenkel set theory and influence results in descriptive set theory, model theory, and proof theory.

Definition and basic properties

An inaccessible cardinal κ is an uncountable regular strong limit cardinal: regularity means κ cannot be expressed as a sum of fewer than κ smaller cardinals, and the strong limit property means for every λ < κ, 2^λ < κ. These requirements make κ a fixed point of many cardinal arithmetic operations and ensure that the rank-initial segment V_κ forms a transitive model of Zermelo–Fraenkel set theory (often with Axiom of Choice), providing an internal universe resembling the full cumulative hierarchy. Basic consequences include closure under power set and replacement up to κ, combinatorial reflection properties used in proofs by Kurt Gödel and later set theorists, and the fact that the existence of κ implies the existence of many smaller large cardinals defined relative to κ.

Historical development and motivation

Motivation for inaccessible cardinals originated in the foundational work of Georg Cantor on cardinality and later formalization of set theory by Ernst Zermelo and Abraham Fraenkel. Kurt Gödel introduced large cardinal hypotheses in his investigations of constructible universe L and relative consistency, using inaccessibles to show that V_κ approximates L_κ and to analyze the Continuum hypothesis. During the mid-20th century, researchers such as Paul Cohen and followers developed forcing and independence techniques that highlighted inaccessible cardinals as natural boundaries for relative consistency proofs. Philosophers and logicians including Solomon Feferman discussed their foundational significance, while mathematicians used them to calibrate strength of axioms in reverse mathematics and proof-theoretic investigations associated with figures like Gerhard Gentzen.

Types and variants

Several strengthened or specialized forms refine the notion of inaccessible. Strong inaccessibles emphasize closure under stronger operations and are compared to weakly inaccessible cardinals, where weak inaccessibility requires only regularity and being a limit of smaller cardinals; the distinction figures in work by Kurt Gödel and later expositors. Mahlo cardinals, measurable cardinals, and compact cardinals are strictly stronger and often studied comparatively in hierarchies developed by researchers like William Mitchell and Solomon Feferman. Other variants include hyper-inaccessible sequences studied in inner model theory by contributors such as Ronald Jensen and W. Hugh Woodin and indescribable cardinals appearing in combinatorial set theory literature by Azriel Levy and others.

Consistency and independence results

The existence of an inaccessible cardinal is unprovable in Zermelo–Fraenkel set theory if ZF is consistent, a phenomenon analyzed through inner model constructions and forcing. Kurt Gödel established relative consistency of some set-theoretic statements from large cardinals by constructing the constructible universe L, while Paul Cohen developed forcing to prove independence results such as independence of the Continuum hypothesis relative to ZF. Relative consistency proofs often assume an inaccessible cardinal to obtain models where additional axioms hold; conversely, determinacy and reflection principles imply large cardinals in various contexts explored by Donald A. Martin and John R. Steel.

Relations to other large cardinals

Inaccessible cardinals occupy the lower tiers of the large cardinal hierarchy but serve as benchmarks: measurable, supercompact, and huge cardinals imply inaccessibility, and strong large cardinals studied by William Mitchell and W. Hugh Woodin refine combinatorial and ultrafilter properties that extend the inaccessible notion. Comparisons involve elementary embeddings introduced in work by Kenneth Kunen and ultrapower techniques central to Robert M. Solovay's analysis of measurability. Inner model theory developed by Ronald Jensen and John R. Steel clarifies how inaccessibles appear in fine-structural core models and in comparisons with determinacy hypotheses from work of Donald A. Martin.

Applications in set theory and logic

Inaccessibles are used to build transitive models V_κ satisfying fragments or full Zermelo–Fraenkel axioms, enabling carrying out model-theoretic constructions, combinatorial principles, and cardinal arithmetic investigations by researchers such as Dana Scott and Thomas Jech. They underpin consistency proofs, calibrate strength in reverse mathematics, and serve in the study of descriptive set theory where determinacy assumptions interact with large cardinal hypotheses advanced by Alexander S. Kechris and Yiannis N. Moschovakis. In proof theory and ordinal analysis, inaccessibles mark transitions where proof-theoretic strength increases, a theme explored in work by Gerald Sacks and Michael Rathjen.

Category:Set theory