Abstract
Project # 43. These functions appear tricky, but the idea is simple. Sn is the function that takes a number written in superbase n and changes all the ‘n’s to ‘n + l’s. gn takes a number and performs n steps in the Goodstein sequence.
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
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Henle, J.M. (1986). Goodstein’s Theorem. In: An Outline of Set Theory. Problem Books in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8680-3_21
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8680-3_21
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-96368-6
Online ISBN: 978-1-4613-8680-3
eBook Packages: Springer Book Archive