Peano Arithmetic and \( \epsilon _0\)
摘要
We bound the growth rate of computable functions provably total in Peano Arithmetic. This is applied to show the independence of Goodstein’s number theoretic result. Proof theoretic methods, including cut-elimination, are introduced to prove the main result.