Skip to main content

Transfinite Recursion

  • Chapter
Naive Set Theory

Part of the book series: Undergraduate Texts in Mathematics ((UTM))

  • 6176 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Publish with us

Policies and ethics