Indexed metadata
Predicatively unprovable termination of the Ackermannian Goodstein process
Toshiyasu Arai, David Fernández-Duque, Stanley Wainer, Andreas Weiermann
Source abstract
The classical Goodstein process gives rise to long but finite sequences of natural numbers whose termination is not provable in Peano arithmetic. In this manuscript we consider a variant based on the Ackermann function. We show that Ackermannian Goodstein sequences eventually terminate, but this fact is not provable using predicative means.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.