Quantcast

From a ball game to incompleteness

Research paper by Arindama Singh

Indexed on: 03 Mar '18Published on: 01 Dec '17Published in: Resonance



Abstract

We present a ball game that can be continued as long as we wish. It looks as though the game would never end. But by applying a result on trees, we show that the game nonetheless ends in some finite number of moves. We then point out some deep results on the natural number system connected with the game.