I am interested to know, possibly in non-technical lay terms, which axioms are really needed to prove the Goodstein's theorem:(adsbygoogle = window.adsbygoogle || []).push({});

http://en.wikipedia.org/wiki/Goodstein's_theorem

and/or other theorems of that type.

It is claimed that it cannot be proved in first order arithmetic. My first question is: What exactly is missing in first order arithmetic which is needed to prove the theorem? Is it perhaps the induction axiom?

The theorem has been proved by using trans-finite numbers. But that's very strange, given that the theorem talks only about finite numbers. My second question is: Can the theorem be proved without using trans-finite numbers?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# (Im)possibility to prove the Goodstein's theorem

Loading...

Similar Threads - possibility prove Goodstein's | Date |
---|---|

I Sets, Subsets, Possible Relations | Feb 23, 2017 |

A Factoring (Possible) Effect of Dunning-Kruger. | Feb 21, 2017 |

I Possibility theory | Feb 8, 2017 |

B How many possible relations between two sets? | Jun 9, 2016 |

Prove 2^n possibly with the binomial theorem | Nov 15, 2010 |

**Physics Forums - The Fusion of Science and Community**