A Goodstein sequence is a certain class of integer sequences Gk(n) that give rise to a quickly growing function that eventually dominates all recursive functions which are provably total in Peano arithmetic, but is itself provably total in PA + "\(\varepsilon_0\) is well-ordered".
| Identifier (URI) | Rank |
|---|---|
| dbkwik:resource/UMLXs58rQoaRGEfEAscRbA== | 5.88129e-14 |