Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

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: http://www.jstor.org/stable/10.4169/amer.math.monthly.120.03.192
Page Count: 7
  • Get Access
  • Download ($19.00)
  • Cite this Item
Item Type
Article
References
If you need an accessible version of this item please contact JSTOR User Support
On Unsettleable Arithmetical Problems
Preview not available

Abstract

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