Additively indecomposable ordinal¶
A nonzero ordinal alpha that cannot be reached or exceeded by adding two smaller ordinals, equivalently an ordinal of the form omega raised to an ordinal power.
Core Idea¶
Additively indecomposable or additive-principal ordinals absorb every smaller ordinal on the left, form a closed unbounded class, and serve as structural landmarks in normal forms and transfinite induction. Ordinal addition concatenates well-orders and is not commutative; omega powers create limit blocks whose order type remains unchanged when any smaller initial block is prefixed. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
Scope of Application¶
Additively indecomposable ordinal belongs to ordinal arithmetic and set theory and is useful where the analyst can specify the typed ordinal arithmetic and set theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the ordinal and nonzero condition, ordinal rather than cardinal addition, quantifier over smaller beta and gamma, strict inequality or absorption formulation, equivalence to omega^delta, finite edge cases, normal-form convention, and closure or enumeration claim are explicit.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the ordinal and nonzero condition, ordinal rather than cardinal addition, quantifier over smaller beta and gamma, strict inequality or absorption formulation, equivalence to omega^delta, finite edge cases, normal-form convention, and closure or enumeration claim are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Additively indecomposable ordinal. Additively indecomposable ordinal compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed ordinal arithmetic and set theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of ordinal arithmetic and set theory because they reuse the typed ordinal arithmetic and set theory carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Ordinal addition concatenates well-orders and is not commutative; omega powers create limit blocks whose order type remains unchanged when any smaller initial block is prefixed., and type the carrier, state every parameter and convention in the definition, test that the ordinal and nonzero condition, ordinal rather than cardinal addition, quantifier over smaller beta and gamma, strict inequality or absorption formulation, equivalence to omega^delta, finite edge cases, normal-form convention, and closure or enumeration claim are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Additively indecomposable ordinal Domain-specific
Parents (1) — more general patterns this builds on
-
Additively indecomposable ordinal is a kind of Closure Prime
The proposed strict upward parent is
prime:closure.
Hierarchy path (1) — routes to 1 parentless root
- Additively indecomposable ordinal → Closure
Neighborhood in Abstraction Space¶
Additively indecomposable ordinal sits in a crowded region of the domain-specific corpus (23rd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Order, Lattices & Set Relations (36 abstractions)
Nearest neighbors
- Transfinite number — 0.92
- Maximal and minimal elements — 0.91
- Continuous function (ordinal theory) — 0.91
- Ordinal definable set — 0.91
- Normal function — 0.91
Computed from structural-signature embeddings · 2026-09-08