Forcing name rank 2026-10-06
The ordinal assigned recursively by . It measures dependency on subnames and justifies generic evaluation by recursion. The ordinary rank of a set also accounts for the coding of the ordered pairs and the forcing conditions; it need not equal this dependency rank of a set.
If , for an infinite cardinal number , satisfies Axiom schema of replacement for every external functional class, then an external cofinal function from an ordinal below cannot exist: its range would have rank of a set and would have to belong to . Similarly, a surjection with is impossible. Infinity therefore makes an uncountable regular cardinal and a strong limit cardinal. Full semantics for second-order logic, allowing arbitrary external functional relations, is essential.
Generic coordinate reals for finite-function forcing Created 2026-10-05 Updated 2026-10-06
For Fn forcing on with values in , the generic filter union is total by the dense coordinate-domain requirements. For each pair of distinct rows, the set of conditions giving them opposite bits at some column is dense: choose a column untouched in both finite rows. Thus the rows are distinct subsets of and provide an injective function from the ground-model ordinal into the extension's power set of . This construction alone does not prove preservation of its ground-model cardinal number status.
Goodstein's theorem 2026-10-06
Every Goodstein sequence reaches zero. Before zero, the ordinal rank of a Goodstein term of each step is strictly smaller than the preceding one. An infinite sequence would contradict well-foundedness of the ordinals below epsilon zero.
Inner model 2026-09-28
An inner model is a transitive class containing every ordinal and satisfying the specified axioms of set theory with the inherited membership relation.
An inner model of ZF containing all ambient subsets of computes the same countable ordinals as the ambient universe. Every ambient countably infinite ordinal has a well-order code coded by a subset of , hence that code belongs to ; finite ordinals are already shared. The Mostowski collapse theorem inside recovers the actual ordinal and its countability witness. Conversely any countability witness in remains one outside. If also contains the full power set of as a set, its Continuum hypothesis would give an ambient bijection from onto that same power set. Thus an ambient failure of this well-orderable formulation of the Continuum hypothesis is preserved in such an inner model. No internal axiom of choice is required for this argument.
Lévy reflection theorem Created 2026-09-24 Updated 2026-10-06
For every finite collection of first-order formulas, there are arbitrarily large ordinals such that, for every and all parameters in ,The reflecting ordinals for form a closed unbounded class.
Minimal walk along a club sequence Created 2026-10-06 Updated 2026-10-07
Non-reflecting subset 2026-10-07
A subset is non-reflecting in the indicated sense if it is not stationary below any of uncountable cofinality. The subset itself need not be stationary. Nonreflection is inherited by subsets. With this definition every subset of is non-reflecting, since all smaller ordinals have countable cofinality.
Order isomorphism 2026-10-06
An order isomorphism is a bijection preserving and reflecting the order relation. It transfers well-foundedness and order type between a coded order and its ordinal interpretation.
Ordinal rank of a Goodstein term 2026-10-06
Replacing every base occurrence by omega in a hereditary base representation gives a Cantor normal form below epsilon zero. Hereditary base change preserves this ordinal expression, and subtraction of one lowers it strictly. The ordinal is a termination measure even when the natural-number value increases.
Paris model 2026-10-03