On Unsettleable Arithmetical Problems

John H. Conway · American Mathematical Monthly · 2013

It has long been known that there are arithmetic statements that are true but not provable, but it is usually thought that they must necessarily be complicated. In this paper, I shall argue that these wild beasts may be just around the corner.

Read the paper · More papers on PaperTik