AWhat changed
Goodstein connected natural-number descent processes to ordinal notation below epsilon zero. Writing numbers hereditarily in a base, replacing that base throughout the nested exponents by the next prescribed nondecreasing base, and subtracting one produces a process that eventually reaches zero. Replacing the finite base by omega assigns a strictly descending ordinal whenever the current number is positive. The paper relates these arithmetical processes to a restricted ordinal well-foundedness principle and develops finitary termination arguments for restricted ordinal heights.
Scientific scope
Goodstein connected natural-number descent processes to ordinal notation below epsilon zero. Writing numbers hereditarily in a base, replacing that base throughout the nested exponents by the next prescribed nondecreasing base, and subtracting one produces a process that eventually reaches zero. Replacing the finite base by omega assigns a strictly descending ordinal whenever the current number is positive. The paper relates these arithmetical processes to a restricted ordinal well-foundedness principle and develops finitary termination arguments for restricted ordinal heights. The general ordinal-descent proof uses well-foundedness below epsilon zero; the paper's explicit finitary arguments cover restricted heights, not one uniform primitive-recursive termination bound for every starting integer. Arbitrary prescribed base functions and the fixed successive-base first-order PA sentence must be distinguished. The 1982 unprovability theorem is a separate contribution and is not backdated to1944. Change-base-then-subtract and subtract-then-change formulations are related in the paper but are not identical trajectories.
Evidence
The linked original works support the scoped statement and contribution attribution. WRS has not independently replayed experiments or reconstructed a full mathematical proof. The general ordinal-descent proof uses well-foundedness below epsilon zero; the paper's explicit finitary arguments cover restricted heights, not one uniform primitive-recursive termination bound for every starting integer. Arbitrary prescribed base functions and the fixed successive-base first-order PA sentence must be distinguished. The 1982 unprovability theorem is a separate contribution and is not backdated to1944. Change-base-then-subtract and subtract-then-change formulations are related in the paper but are not identical trajectories.
Contributors
- The named authors in the research record · SCIENCE: Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred.
Provisional WRS assessment, edition 2026-10-23.3. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction