If transitive models of enough set theory contain the same , then they agree on whether is a strongly inaccessible cardinal. They have the same subsets and functions on every ordinal below , so they agree on cardinality, regularity, and the strong limit cardinal property.
Uniformly narrow regular-height tree branch theorem Created 2026-10-07 Updated 2026-10-14
For infinite regular cardinals , a -tree whose levels all have size less than has a cofinal branch. At levels of cofinality , bound all heights distinguishing distinct predecessor chains. The Fodor lemma makes this bound constant on a stationary set; one predecessor at that height occurs stationarily often. The resulting predecessor chains agree below their common heights and unite into a branch through every level. Distinct limit-level nodes with identical predecessor chains do not affect this argument.
Weakly inaccessible cardinal 2026-10-06
A weakly inaccessible cardinal is an uncountable regular cardinal that is a limit cardinal. It need not be a strong limit cardinal. Under the Generalized continuum hypothesis, it is a strongly inaccessible cardinal, since every smaller infinite satisfies .