Abstract
This communication contains a description of Shelah’s recent proof for the Hales-Jewett Theorem, in a condensed (and yet self contained) form. For simplicity we include here only the proof of the one dimensional case of the theorem, which solves a problem of Graham by showing that the Hales-Jewett function is primitive recursive. The general cases will appear in the full paper of Shelah.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Shelah, S. (To appear)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nilli, A. (1990). Shelah’s Proof of the Hales-Jewett Theorem. In: Nešetřil, J., Rödl, V. (eds) Mathematics of Ramsey Theory. Algorithms and Combinatorics, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72905-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-72905-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-72907-2
Online ISBN: 978-3-642-72905-8
eBook Packages: Springer Book Archive