Ordinals
DefinitionOrdinal#
Ordinal.{u} is the type of well orders in Type u, up to order isomorphism.
Ordinal.{u} : Type (u + 1)
Sources
Used by 8
DefinitionCantor normal form#
The Cantor normal form of an ordinal o is the list of coefficients and exponents in the
base-b expansion of o.
We special-case CNF 0 o = CNF 1 o = [(0, o)] for o ≠ 0.
CNF b (b ^ u₁ * v₁ + b ^ u₂ * v₂) = [(u₁, v₁), (u₂, v₂)]
Ordinal.CNF.{u_1} (b o : Ordinal.{u_1}) : List (Ordinal.{u_1} × Ordinal.{u_1})
Sources
Uses 3
StructureFundamental sequences#
A fundamental sequence for o is a strictly monotonic function Iio o.cof.ord → Iio o with
cofinal range. We provide a = o.cof.ord explicitly to avoid type rewrites.
Ordinal.IsFundamentalSeq.{u_1} {a o : Ordinal.{u_1}} (f : ↑(Set.Iio a) → ↑(Set.Iio o)) : Prop
Sources
Uses 2
AbbreviationEpsilon numbers#
The epsilon function enumerates the fixed points of ω ^ ⬝.
This is an abbreviation for veblen 1.
Conventions for notations in identifiers:
- The recommended spelling of
ε_in identifiers isepsilon.
Ordinal.epsilon.{u_1} : Ordinal.{u_1} → Ordinal.{u_1}
Sources
Uses 3
DefinitionGamma numbers#
The gamma function enumerates the fixed points of veblen · 0.
Of particular importance is Γ₀ = gamma 0, the Feferman-Schütte ordinal.
Conventions for notations in identifiers:
- The recommended spelling of
Γ_in identifiers isgamma.
Ordinal.gamma.{u_1} : Ordinal.{u_1} → Ordinal.{u_1}
Sources
Uses 3
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.