Abstract
The process of “definition by induction” has a transfinite analogue. The ordinary recursion theorem constructs a function on ω; the raw material is a way of getting the value of the function at each non-zero element n of ω from its value at the element preceding n. The transfinite analogue constructs a function on any well ordered set W; the raw material is a way of getting the value of the function at each element a of W from its values at all the predecessors of a.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer Science+Business Media New York
About this chapter
Cite this chapter
Halmos, P.R. (1974). Transfinite Recursion. In: Naive Set Theory. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-1645-0_18
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1645-0_18
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-90104-6
Online ISBN: 978-1-4757-1645-0
eBook Packages: Springer Book Archive