David Fernandez-Duque: When Ackermann meets Goodstein

Item: David Fernandez-Duque: When Ackermann meets Goodstein
Rating: 4
Author: PostSingularity Institute

by David Fernandez-Duque

Formal & Physical Sciences Mathematics PBCMathematical foundations PBCDMathematical logic

🎙 David Fernandez-Duque 👥 1K 📅 August 23, 2021 ⏱ 62 min 👁 138 📄 original study 🧭 2026-08-17

Available in: English (current) Français

Keywords

Ackermann functionGoodstein's theoremordinal analysisproof theoryindependence

Summary

The talk, part of a workshop on Gödel’s incompleteness theorems, presents joint work on generalizing Goodstein’s principle using the Ackermann function as a notation system. The speaker begins by recalling Goodstein’s original theorem, which states that a certain sequence of natural numbers, defined by writing a number in hereditary base notation and repeatedly changing the base and subtracting one, eventually reaches zero. He explains that this theorem is independent of Peano arithmetic and its proof uses ordinal analysis up to ε₀. He then introduces the Ackermann function, a fast-growing function that is not primitive recursive, and proposes to use it as a basis for a notation system for natural numbers, similar to hereditary base notation. He defines three possible ways to write numbers using the Ackermann function, each leading to a different notion of base change and thus different Goodstein-like sequences. The main questions are whether these sequences terminate, and if so, what is the proof-theoretic strength of their termination. The speaker shows that the termination of these sequences corresponds to the well-foundedness of certain ordinal notations, and that the proof-theoretic strength varies depending on the notation system chosen. He identifies a maximum strength, which is related to the ordinal Γ₀ (Feferman–Schütte ordinal), and discusses the theories ACA₀, ACA₀’, ACA₀⁺, and ATR₀ in this context. The talk concludes with a sketch of the proof technique, showing how the Ackermann-based notation maps to Veblen normal forms, and how fundamental sequences provide lower bounds for the Goodstein process, leading to independence results.

250 words

Critical Evaluation

Value of the Information & Strength of the Argument

The talk provides a novel and insightful connection between the Ackermann function and Goodstein’s principle, offering a new perspective on independence results in arithmetic. The argumentation is rigorous, with clear definitions and proof sketches. The speaker carefully explains the intuition behind the technical constructions, making the material accessible to a mathematically literate audience. The value lies in the original research presented, which extends classical results and provides a unified framework for understanding the strength of such principles.

Scientific Rigor, Source Quality, Title Accuracy

The talk is scientifically rigorous, with precise definitions and logical arguments. The speaker references standard concepts in proof theory (e.g., ACA₀, ATR₀, Veblen functions) and builds on the work of Goodstein, Kirby, Paris, and others. The title accurately reflects the content, which explores the meeting of Ackermann and Goodstein. The talk is part of a workshop on Gödel’s incompleteness theorems, indicating a scholarly context. No external sources are cited beyond the workshop’s website, but the mathematical content is self-contained and based on established literature.

176 words

Title / Content Match

The title accurately reflects the content, which explores connections between Ackermann's function and Goodstein's principle.

Quality & Reliability

8/10

The talk presents original research in proof theory, with rigorous mathematical definitions and proofs sketched. The speaker is an established researcher (PhD under Gregory Mints, Dublin Prize winner). The content is technical and appears accurate, though the presentation is informal and some details are omitted.

Key Moments

Markers derived by PSI from the transcript: the creator did not define chapters.

Cited Sources

Workshop website — The talk is part of the Online International Workshop on Gödel's Incompleteness Theorems at Wuhan University.
Workshop slides — Slides for all lectures of the workshop, including this talk.

Concurring Sources

Goodstein's theorem — The original theorem and its independence from PA, which the talk builds upon.
Ackermann function — The function used as a basis for the new notation system.

Contribution & Novelties

The talk presents original research that generalizes Goodstein’s theorem using the Ackermann function as a notation system, providing new independence results and a maximum proof-theoretic strength. The approach offers a novel connection between fast-growing hierarchies and ordinal analysis.

Pour aller plus loin :

Goodstein’s theorem — Background on the original theorem and its independence from PA.
Ackermann function — Definition and properties of the Ackermann function.
Ordinal analysis — Overview of proof-theoretic ordinals and their role in measuring strength.
Veblen function — The hierarchy used in the talk for ordinal notation.
Feferman–Schütte ordinal — The ordinal Γ₀, which is the maximum strength discussed.

103 words

Radar Profile

The radar profile shows high scores in all dimensions, with particularly strong performance in information quality and technical level, reflecting the advanced mathematical content and rigorous presentation. The lower score in information quantity is due to the focused scope of the talk, which is appropriate for a research seminar.

Reliability 8/10