You are not currently logged in.

Access JSTOR through your library or other institution:


Log in through your institution.

On Unsettleable Arithmetical Problems

John H. Conway
The American Mathematical Monthly
Vol. 120, No. 3 (March 2013), pp. 192-198
DOI: 10.4169/amer.math.monthly.120.03.192
Stable URL:
Page Count: 7
  • More info
  • Add to My Lists
  • Cite this Item
On Unsettleable Arithmetical Problems
Preview not available


Abstract 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.

Page Thumbnails